题目:
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
解释:
判断数组中是否有重复的元素。
python代码:
class Solution(object):
def containsDuplicate(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
return len(set(nums))!=len(nums)
c++代码:
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
set<int>_set(nums.begin(),nums.end());
return nums.size()!=_set.size();
}
};
总结:
这种判断是重复的题目,要合理使用set()
。