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
Approach #1: c++.
class Solution { public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_map<string, int> mp; for (int i = 1; i <= nums.size(); ++i) { if ((mp[to_string(nums[i-1])] > 0) && i - mp[to_string(nums[i-1])] <= k) return true; else mp[to_string(nums[i-1])] = i; } return false; } };
Approach #2: Java.
class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { Set<Integer> set = new HashSet<Integer>(); for (int i = 0; i < nums.length; ++i) { if (i > k) set.remove(nums[i-k-1]); if (!set.add(nums[i])) return true; } return false; } }
Approach #3: Python.
class Solution(object): def containsNearbyDuplicate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: bool """ dic = {} for i, v in enumerate(nums): if v in dic and i - dic[v] <= k: return True dic[v] = i return False
Time Submitted | Status | Runtime | Language |
---|---|---|---|
a few seconds ago | Accepted | 44 ms | python |
a minute ago | Accepted | 7 ms | java |
4 minutes ago | Accepted | 52 ms | cpp |