ProblemL: https://leetcode.com/problems/contains-duplicate/
Solution1:
class Solution {
public boolean containsDuplicate(int[] nums) {
// 暴力枚举
for(int i = 0; i < nums.length; i++) {
for(int j = i+1; j < nums.length; j++) {
if(nums[i] == nums[j]) {
return true;
}
}
}
return false;
}
}
Solution2:
class Solution {
public boolean containsDuplicate(int[] nums) {
// 排序检测
Arrays.sort(nums);
for(int i = 0; i < nums.length-1; i++) {
if(nums[i] == nums[i+1]) {
return true;
}
}
return false;
}
}