[N-0] refactor 697

Author: fishercoder1534

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

@@ -1,14 +1,16 @@
 package com.fishercoder.solutions;
 
 import java.util.ArrayList;
+import java.util.Collections;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 
 /**
  * 697. Degree of an Array
  *
- * Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
+ * Given a non-empty array of non-negative integers nums,
+ * the degree of this array is defined as the maximum frequency of any one of its elements.
  * Your task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.
 
  Example 1:
@@ -75,4 +77,29 @@ int findLength(int[] arr, int candidate) {
             return (lastAppearance - firstAppearance) + 1;
         }
     }
+
+    public static class Solution2 {
+        public int findShortestSubArray(int[] nums) {
+            Map<Integer, Integer> count = new HashMap<>();
+            Map<Integer, Integer> left = new HashMap<>();
+            Map<Integer, Integer> right = new HashMap<>();
+
+            for (int i = 0; i < nums.length; i++) {
+                count.put(nums[i], count.getOrDefault(nums[i], 0) + 1);
+                if (!left.containsKey(nums[i])) {
+                    left.put(nums[i], i);
+                }
+                right.put(nums[i], i);
+            }
+
+            int result = nums.length;
+            int degree = Collections.max(count.values());
+            for (int num : count.keySet()) {
+                if (count.get(num) == degree) {
+                    result = Math.min(result, right.get(num) - left.get(num) + 1);
+                }
+            }
+            return result;
+        }
+    }
 }

src/test/java/com/fishercoder/_697Test.java

@@ -8,41 +8,48 @@
 
 public class _697Test {
     private static _697.Solution1 solution1;
+    private static _697.Solution2 solution2;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _697.Solution1();
+        solution2 = new _697.Solution2();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1};
         assertEquals(1, solution1.findShortestSubArray(nums));
+        assertEquals(1, solution2.findShortestSubArray(nums));
     }
 
     @Test
     public void test2() {
         nums = new int[]{1, 2, 2, 3, 1};
         assertEquals(2, solution1.findShortestSubArray(nums));
+        assertEquals(2, solution2.findShortestSubArray(nums));
     }
 
     @Test
     public void test3() {
         nums = new int[]{1, 2, 2, 3, 1, 1};
         assertEquals(6, solution1.findShortestSubArray(nums));
+        assertEquals(6, solution2.findShortestSubArray(nums));
     }
 
     @Test
     public void test4() {
         nums = new int[]{1, 2, 2, 3, 1, 1, 5};
         assertEquals(6, solution1.findShortestSubArray(nums));
+        assertEquals(6, solution2.findShortestSubArray(nums));
     }
 
     @Test
     public void test5() {
         nums = new int[]{1, 2, 2, 3, 1, 4, 2};
         assertEquals(6, solution1.findShortestSubArray(nums));
+        assertEquals(6, solution2.findShortestSubArray(nums));
     }
 
 }