排序,比较邻近
class Solution {
public boolean containsDuplicate(int[] nums
) {
if(nums
==null
||nums
.length
<=1) return false;
Arrays
.sort(nums
);
for(int i
=1;i
<nums
.length
;i
++){
if(nums
[i
]==nums
[i
-1]){
return true;
}
}
return false;
}
}
转载请注明原文地址: https://yun.8miu.com/read-106649.html