[LeetCode]219. Contains Duplicate II 解题报告(C++)

[LeetCode]219. Contains Duplicate II 解题报告(C++)

题目描述

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

题目大意

• 给定数组和k.
• 找到是否 存在 两个相等的数.二者索引之间的绝对值 最大 是k
• 由于是存在! 所以找的是 相等的数索引的最小值.
• 主要最小值<=k即可.

解题思路

方法1:

• 暴力解法.
• 双重循环

代码实现:

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        int size = nums.size();
        int len = k+1;
        for (int i = 0; i < size; i++) {
            for (int j = i + 1; j < size; j++) {
                if (nums[i] == nums[j]) {
                    len = min(j - i, len);
                    break;
                }
            }
        }
        return len<=k;
    }
};

方法2:

• 使用 map 来边遍历边记录 数字与索引i的关系.
• 若存在! 索引距离小于等于k则真

代码实现:

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

---