leetcode 国内网站:
https://leetcode-cn.com/problemset/all/
感觉第一个还是很简单的,O(∩_∩)O哈哈~,可能我还没有被现实打击吧,分享给大家,希望大家可以一起进步!!
public boolean containsDuplicate(int[] nums) {
int a = 0;
Arrays.sort(nums);
for(int i=0;i<nums.length-1;i++){
if(nums[i]==nums[i+1]){
return true;
}
}
return false;
}
public boolean containsDuplicate(int[] nums) {
Set<Integer> set = new HashSet<>(nums.length);
for (int x: nums) {
if (set.contains(x)) return true;
set.add(x);
}
return false;
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/contains-duplicate/solution/cun-zai-zhong-fu-yuan-su-by-leetcode/
来源:力扣(LeetCode)