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
终于遇到一道超简单的了~直接上代码ac
class Solution {
public boolean containsDuplicate(int[] nums) {
//排序数组
Arrays.sort(nums);
boolean flage = false;
for(int i =0; i<nums.length-1;i++){
//判断
if(nums[i]==nums[i+1]){
flage = true;
break;
}
}
return flage;
}
}