题目:
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.
题解:
hashmap。
C++版:
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
unordered_map<int, bool> dict;
for(auto i : nums) {
if(dict.find(i) != dict.end())
return true;
dict.insert(pair<int, bool>(i, true));
}
return false;
}
};
Java版:
public class Solution {
public boolean containsDuplicate(int[] nums) {
HashMap<Integer, Boolean> dict = new HashMap<>();
for(int i = 0; i < nums.length; i++) {
if(dict.containsKey(nums[i]))
return true;
dict.put(nums[i], true);
}
return false;
}
}
Python版:
class Solution(object):
def containsDuplicate(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
dict = {}
for i in nums:
if i in dict:
return True
dict[i] = True
return False