Modified Contains Duplicate III.java

varunu28 · varunu28 · commit e68a3dfc0422 · 2020-09-02T09:49:02.000-05:00
diff --git a/Medium/Contains Duplicate III.java b/Medium/Contains Duplicate III.java
@@ -1,23 +1,18 @@
 class Solution {
-    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
-        TreeSet<Long> treeSet = new TreeSet<>();
-        for (int i=0; i<nums.length; i++) {
-            long num = nums[i];
-            Long floor = treeSet.floor(num + t);
-            Long ceil = treeSet.ceiling(num - t);
-
-            if (floor != null && floor >= nums[i] ||
-                ceil != null && ceil <= nums[i]) {
-                return true;
-            }
-
-            treeSet.add(num);
-
-            if (i >= k) {
-                treeSet.remove((long) nums[i - k]);
-            }
-        }
-
-        return false;
+  public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
+    TreeSet<Long> set = new TreeSet<>();
+    for (int i = 0; i < nums.length; i++) {
+      long num = nums[i];
+      Long floor = set.floor(num + t);
+      Long ceil = set.ceiling(num - t);
+      if ((floor != null && floor >= num) || (ceil != null && ceil <= num)) {
+        return true;
+      }
+      set.add(num);
+      if (i >= k) {
+        set.remove((long) nums[i - k]);
+      }
     }
+    return false;
+  }
 }
