Leetcode学习（28）—— Contains Duplicate II

最新推荐文章于 2020-04-19 07:30:50 发布

HeatDeath

最新推荐文章于 2020-04-19 07:30:50 发布

阅读量419

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文为博主原创文章，未经博主允许不得转载。哈哈哈

本文链接：https://blog.csdn.net/HeatDeath/article/details/71434305

版权

Leetcode 专栏收录该内容

53 篇文章 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 absolute difference between i and j is at most k.

# -*- coding:utf-8 -*-
class Solution(object):
    def containsNearbyDuplicate(self, nums, k):
        if len(nums) <= 1:
            return False
        dic = {}
        for key, value in enumerate(nums):
            if value in dic and key - dic[value] <= k:
                return True
            dic[value] = key
        return False