Easy
452558FavoriteShare
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
哈希表法(HashSet):
Java:
import java.util.Set;
/*
* @Author: SourDumplings
* @Date: 2019-08-20 20:55:58
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/contains-duplicate/
*/
class Solution
{
public boolean containsDuplicate(int[] nums)
{
Set<Integer> set = new HashSet<>();
for (int i : nums)
{
if (set.contains(i))
{
return true;
}
set.add(i);
}
return false;
}
}
排序法:
C++:
/*
* @Author: SourDumplings
* @Date: 2019-08-20 20:47:30
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/contains-duplicate/
*/
class Solution
{
public:
bool containsDuplicate(vector<int> &nums)
{
sort(nums.begin(), nums.end());
int n = nums.size();
for (int i = 0; i < n - 1; i++)
{
if (nums[i] == nums[i + 1])
{
return true;
}
}
return false;
}
};
Java:
import java.util.Arrays;
/*
* @Author: SourDumplings
* @Date: 2019-08-20 20:55:58
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/contains-duplicate/
*/
class Solution
{
public boolean containsDuplicate(int[] nums)
{
Arrays.sort(nums);
int n = nums.length;
for (int i = 0; i < n - 1; i++)
{
if (nums[i] == nums[i + 1])
{
return true;
}
}
return false;
}
}
红黑树法(set):
C++:
/*
* @Author: SourDumplings
* @Date: 2019-08-20 20:47:30
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/contains-duplicate/
*/
class Solution
{
public:
bool containsDuplicate(vector<int> &nums)
{
set<int> s;
for (auto &&i : nums)
{
if (s.find(i) != s.end())
{
return true;
}
s.insert(i);
}
return false;
}
};