add a solution for 1695

fishercoder1534 · fishercoder1534 · commit 263e0d8ea875 · 2021-10-20T20:01:45.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1695.java b/src/main/java/com/fishercoder/solutions/_1695.java
@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
+import java.util.HashMap;
 import java.util.HashSet;
+import java.util.Map;
 import java.util.Set;
 
 public class _1695 {
@@ -26,4 +28,29 @@ public int maximumUniqueSubarray(int[] nums) {
             return maxSum;
         }
     }
+
+    public static class Solution2 {
+        /**
+         * My completely original solution on 10/202/2021. Classic sliding window solution.
+         */
+        public int maximumUniqueSubarray(int[] nums) {
+            Map<Integer, Integer> map = new HashMap<>();
+            int sum = 0;
+            int start = 0;
+            int ans = 0;
+            for (int i = 0; i < nums.length; i++) {
+                if (map.containsKey(nums[i])) {
+                    Integer lastIndex = map.get(nums[i]);
+                    while (start <= lastIndex) {
+                        sum -= nums[start];
+                        start++;
+                    }
+                }
+                sum += nums[i];
+                map.put(nums[i], i);
+                ans = Math.max(ans, sum);
+            }
+            return ans;
+        }
+    }
 }
diff --git a/src/test/java/com/fishercoder/_1695Test.java b/src/test/java/com/fishercoder/_1695Test.java
@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1695;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1695Test {
+    private static _1695.Solution1 solution1;
+    private static _1695.Solution2 solution2;
+    private static int[] nums;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1695.Solution1();
+        solution2 = new _1695.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{4, 2, 4, 5, 6};
+        expected = 17;
+        assertEquals(expected, solution1.maximumUniqueSubarray(nums));
+        assertEquals(expected, solution2.maximumUniqueSubarray(nums));
+    }
+
+}
