lc219. Contains Duplicate II

最新推荐文章于 2025-09-11 21:03:21 发布

转载最新推荐文章于 2025-09-11 21:03:21 发布 · 99 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://juejin.im/post/5ce78a09e51d45109b01b117

文章标签：

#python

博客围绕LeetCode 219题“Contains Duplicate II”展开，给定整数数组和整数k，判断数组中是否存在两个不同索引i和j，使nums[i]=nums[j]且i和j的绝对差至多为k。给出示例及Python解题思路和代码。

219. Contains Duplicate II

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

思路：用字典存数组和下标dic[1]=0，存的时候，如果之前有值，比较新的值下标和之前的差，index-dic[1] <= k,如果小于，返回True，遍历完，返回False

代码：python3

class Solution:
    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
        dic = {}
        for index,value in enumerate(nums):
            if value not in dic:
                dic[value] = index
            else:
                if index-dic[value] <= k:
                    return True
                else:
                    dic[value] = index
        return False
复制代码

转载于:https://juejin.im/post/5ce78a09e51d45109b01b117