Given an integer array
nums
, returntrue
if any value appears at least twice in the array, and returnfalse
if every element is distinct.给定一个整数数组,判断是否存在重复元素。
如果存在一值在数组中出现至少两次,函数返回
true
。如果数组中每个元素都不相同,则返回false
Example 1:
Input: nums = [1,2,3,1] Output: trueExample 2:
Input: nums = [1,2,3,4] Output: falseExample 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: trueConstraints:
1 <= nums.length <= 105
-109 <= nums[i] <= 109
这题我就不讲解了,太简单了。
class Solution {
public boolean containsDuplicate(int[] nums) {
int j = 0;
boolean flag = false;
Arrays.sort(nums);
if(nums.length == 1) return false;
for(int i = 0;i < nums.length - 1;i++){
j = i+1;
if(nums[i] == nums[j]){
flag = true;
break;
}
}
return flag;
}
}