Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true
Example 2:
Input: nums = [1,2,3,4]
Output: false
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
Constraints:
- 1 <= nums.length <= 105
- -109 <= nums[i] <= 109
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;
}
}
'알고리즘 문제 > Leetcode' 카테고리의 다른 글
409. LongestPalindrome (0) | 2022.11.29 |
---|---|
Unique Number of Occurrences (0) | 2022.10.06 |
Fizz Buzz (0) | 2022.10.06 |
Best Time to Buy and Sell Stock (0) | 2022.10.04 |
Valid Parentheses (0) | 2022.09.28 |