标签：
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
标签：
原文地址：http://www.cnblogs.com/allenhaozi/p/4728806.html
