//利用sort先排序再进行查找,降低时间复杂度
class Solution {
public boolean containsDuplicate (int [] nums){
Arrays.sort(nums);
for (int i = 1; i < nums.length; i++) {
if(nums[i-1] == nums[i]){
return true;
}
}
return false;
}
}
//利用sort先排序再进行查找,降低时间复杂度
class Solution {
public boolean containsDuplicate (int [] nums){
Arrays.sort(nums);
for (int i = 1; i < nums.length; i++) {
if(nums[i-1] == nums[i]){
return true;
}
}
return false;
}
}