[N-0] refactor 697

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_697.java

@@ -58,23 +58,21 @@ public int findShortestSubArray(int[] nums) {
         }
 
         int findLength(int[] arr, int candidate) {
-            {
-                int firstAppearance = Integer.MAX_VALUE;
-                for (int i = 0; i < arr.length; i++) {
-                    if (arr[i] == candidate) {
-                        firstAppearance = i;
-                        break;
-                    }
+            int firstAppearance = Integer.MAX_VALUE;
+            for (int i = 0; i < arr.length; i++) {
+                if (arr[i] == candidate) {
+                    firstAppearance = i;
+                    break;
                 }
-                int lastAppearance = arr.length - 1;
-                for (int i = arr.length - 1; i > firstAppearance; i--) {
-                    if (arr[i] == candidate) {
-                        lastAppearance = i;
-                        break;
-                    }
+            }
+            int lastAppearance = arr.length - 1;
+            for (int i = arr.length - 1; i > firstAppearance; i--) {
+                if (arr[i] == candidate) {
+                    lastAppearance = i;
+                    break;
                 }
-                return (lastAppearance - firstAppearance) + 1;
             }
+            return (lastAppearance - firstAppearance) + 1;
         }
     }
 }