217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates.
Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
Example 1:
Input: [1,2,3,1]
Output: true
Example 2:
Input: [1,2,3,4]
Output: false
Example 3:
Input: [1,1,1,3,3,4,3,2,4,2]
Output: true
给定一个整数数组,查找该数组是否包含任何重复项。
如果数组中出现任何值至少两次,函数应该返回true;如果每个元素都是不同的,函数应该返回false。
思路:利用set(),对原数组进行set,如果原数组的长度等于set后数组的长度,则说明没有重复的元素,就返回False,否则返回true
class Solution:
def containsDuplicate(self, nums):
nums_set=set(nums)
if len(nums)==len(nums_set):
return False
else:
return True
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
给定一个数组,和一个整数k,判断该数组中是否存在不同下标的 i 和 j 两个元素,使得 nums[i] = nums[j],且 i 和 j 的差不超过k。
思路:遍历所有元素,将元素值当做键、元素下标当做值,存放在一个字典中。遍历的时候,如果发现重复元素,则比较其下标的差值是否小于k,如果小于则可直接返回True,否则更新字典中该键的值为新的下标。
class Solution:
def containsNearbyDuplicate(self, nums, k):
num_map={}
for i in range(len(nums)):
if nums[i] in num_map and i-num_map[nums[i]]<=k:\
return True
else:
num_map[nums[i]] = i
return False