leetcode --Contains Duplicate II

最新推荐文章于 2024-09-22 04:59:47 发布

huangzhebin1992

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量280

点赞数

分类专栏： leetcode 文章标签： leetcode 算法数组

本文链接：https://blog.csdn.net/zlpzhebin/article/details/49070401

版权

leetcode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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 difference between i and jis at most k.

注：特殊情况k=0时直接返回false

bool containsNearbyDuplicate(int* nums, int numsSize, int k) {

if (k == 0)
return false;
for(int i = 0; i < numsSize - 1; i++) {
for(int j = i + 1; j <= i + k && j < numsSize; j++) {
if (nums[i] == nums[j])
return true;
}
}
return false;
}