[LeetCode] Contains Duplicate
文章目录
Contains Duplicate
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.
Solution
Use HashSet
class Solution {
public boolean containsDuplicate(int[] nums) {
if (nums == null || nums.length == 0) return false;
HashSet<Integer> set = new HashSet<>();
for (int num: nums) {
if (set.contains(num)) {
return true;
} else {
set.add(num);
}
}
return false;
}
}
Sort and compare adjacent numbers
class Solution {
public boolean containsDuplicate(int[] nums) {
if (nums == null || nums.length < 2) return false;
Arrays.sort(nums);
for (int i = 1; i < nums.length; i++) {
if (nums[i] == nums[i-1]) return true;
}
return false;
}
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论