Problem Description:
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: trueExample 2:
Input: nums = [1,0,1,1], k = 1 Output: trueExample 3:
Input: nums = [1,2,3,1,2,3], k = 2 Output: false
Analysis:
遍历整个序列,然后在每个元素的基础上遍历k个元素,如果符合题意就输入。代码如下:
Code:
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
for(int i = 0; i < nums.length; i++) {
for(int j = i + 1; j <= k + i; j++) {
if(j < nums.length && nums[i] == nums[j]) {
return true;
}
}
}
return false;
}
}