219. Contains Duplicate II

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

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true

Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

方法1: hash

思路：

hash所有数字的位置，因为如果有小于k的距离，一定有相邻两个位置小于k，只需要扫过所有数组，找相邻相差<=k的两个数。

易错点

不是pos的index，而是pos本身小于等于k

Complexity

Time complexity: O(n)
Spade complexity: O(n)

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        unordered_map<int, vector<int>> hash;
        for (int i= 0;i < nums.size(); i++){
            hash[nums[i]].push_back(i);
        }
        
        for (auto pair: hash){
            vector<int> pos = pair.second;
            for (int i = 0; i< pos.size(); i++){
                if (i < pos.size() - 1 && pos[i + 1] - pos[i] <= k){
                    return true;
                }
            }
        }
        return false;
    }
};

grandyang: http://www.cnblogs.com/grandyang/p/4539680.html

另一个one pass不用储存所有位置的解法，因为每一个map的映射值当中只会用到上一个数字。如果满足<=k，返回true，不满足取代映射值继续寻找

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        unordered_map<int, int> m;
        for (int i = 0; i < nums.size(); ++i) {
            if (m.find(nums[i]) != m.end() && i - m[nums[i]] <= k) return true;
            else m[nums[i]] = i;
        }
        return false;
    }
};