zoukankan      html  css  js  c++  java
  • leetcode Contains Duplicate II python

    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 difference between i and j is at most k.

    class Solution:
        # @param {integer[]} nums
        # @param {integer} k
        # @return {boolean}
        def containsNearbyDuplicate(self, nums, k):
            length = len( nums )
            if length <= 1:
                return False
            if k <= 0:
                return False
            arrMap = {}
            for i in range(0, length):
                if arrMap.has_key( nums[i] ):
                    j = arrMap[nums[i]]
                    if i - j <= k:
                        return True
                arrMap[nums[i]] = i
            return False
  • 相关阅读:
    HiperLink
    三次贝塞尔曲线平滑多边形
    SimpleIni
    Segment
    SegIntersect
    OneTif
    OneSeg
    MiniDump
    MfcStrFile
    vmware workstation 如何配置NAT
  • 原文地址:https://www.cnblogs.com/allenhaozi/p/4728806.html
Copyright © 2011-2022 走看看