Leetcode 219. Contains Duplicate II

最新推荐文章于 2024-11-18 22:29:24 发布

小白菜又菜

最新推荐文章于 2024-11-18 22:29:24 发布

阅读量100

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/mobius_strip/article/details/130804504

版权

Problem

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Algorithm

Sort the index based on the value and then compare the adjacent index.

Code

class Solution:
    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
        nlen = len(nums)
        ids = [x for x in range(nlen)]
        ids = [x for _, x in sorted(zip(nums, ids))]
        L ,R = 0, 0
        while R < nlen:
            while L < R and nums[ids[R]] != nums[ids[L]]:
                L += 1
            while L < R and nums[ids[L+1]] == nums[ids[L]]:
                if L < R and ids[L+1]-ids[L] <= k:
                    return True
                L += 1
            R += 1
        return False