219 - Contains Duplicate II

绿水兰田

于 2019-07-16 13:57:22 发布

阅读量208

点赞数 1

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/LvShuiLanTian/article/details/96131717

leetcode 专栏收录该内容

83 篇文章

订阅专栏

本文介绍了解决LeetCode 219题目的方法，该题目要求判断一整数数组中是否存在两个不同的索引i和j使得对应的值相等且索引之间的绝对差不超过给定值k。通过示例展示了如何使用自定义结构体和排序策略来高效解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

219 - Contains Duplicate II

Problem

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

Code

struct Obj {
    int loc;
    int val;
    Obj(int l, int v) : loc(l), val(v) {
        
    }
};

class Solution {
public:
    static bool compare(Obj* fir, Obj* sec) {
        return fir->val > sec->val;
    }
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        vector<Obj*> objs;
        int size = nums.size();
        for (int i = 0; i < size; ++i) {
            objs.push_back(new Obj(i, nums[i]));
        }
        sort(objs.begin(), objs.end(), compare);
        for (int i = 1; i < size; ++i) {
            if (objs[i]->val == objs[i - 1]->val && abs(objs[i]->loc - objs[i- 1]->loc)<=k) {
                return true;
            } 
        }
        return false;
    }
};