leetcode 217.存在重复元素
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
return len(set(nums)) < len(nums)
set()集合自动去重,如果存在重复元素去重后长度一定小于原数组的长度
leetcode 1.两数之和
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
dic = {}
for index, num in enumerate(nums):
if target - num in dic:
return [dic[target-num],index]
else :
dic[num] = index
用枚举,哈希表
enumerate()返回数的索引和值,两数之和减去元素1,元素2如果在哈希表内就返回他在表内的值和元素1的索引