220. Contains Duplicate III

最新推荐文章于 2020-03-01 20:16:57 发布

xdhc304

最新推荐文章于 2020-03-01 20:16:57 发布

阅读量178

点赞数

分类专栏： leetcode 文章标签： leetcode-java

本文链接：https://blog.csdn.net/xdhc304/article/details/78922438

版权

leetcode 专栏收录该内容

599 篇文章 0 订阅

订阅专栏

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.

思路：
维持一个长度为k的window, 每次检查新的值是否与原来窗口中的所有值的差值有小于等于t的. 如果用两个for循环会超时O(nk). 使用treeset( backed by binary search tree) 的subSet函数,可以快速搜索. 复杂度为O(n logk)。

class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        if(k < 1 || t < 0 || nums == null || nums.length < 2) 
            return false;  
          
        SortedSet<Long> set = new TreeSet<Long>();  
          
        for(int j = 0; j < nums.length; j++) {  
            SortedSet<Long> subSet =  set.subSet((long)nums[j] - t, (long)nums[j] + t + 1);  
            if(!subSet.isEmpty()) 
                return true;  
              
            if(j >= k) {  
                set.remove((long)nums[j - k]);  
            }  
            set.add((long)nums[j]);  
        }  
        return false;  
    }
}

class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        TreeMap<Long, Integer> map = new TreeMap<>();
        int j=0;
        for(int i=0;i<nums.length;i++) {
            if(i-j>k) {
                if(map.get(Long.valueOf(nums[j]))==j)
                    map.remove(Long.valueOf(nums[j]));
                j++;
            }
            
            if(map.ceilingKey(Long.valueOf(nums[i])-t)!=null && map.ceilingKey(Long.valueOf(nums[i])-t)<=Long.valueOf(nums[i])+t)
                return true;
            
            map.put(Long.valueOf(nums[i]), i);
        }
        return false;
    }
}