219. Contains Duplicate II

Author: SinnoLn

leetcode3/이진희/219. Contains Duplicate II.java

@@ -0,0 +1,19 @@
+class Solution {
+    public boolean containsNearbyDuplicate(int[] nums, int k) {
+        //100000
+
+        Set<Integer>set = new HashSet<>();
+
+        for(int i=0; i<nums.length; i++) {
+            if(set.contains(nums[i])) return true;
+
+            set.add(nums[i]);
+
+            if(set.size() > k) {
+                set.remove(nums[i-k]);
+            }
+        }
+
+        return false;
+    }
+}