217. Contains Duplicate
Last updated
Last updated
/**
* Time complexity : O(N^2)
* Space complexity : O(1)
*/
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[j] == nums[i]) return true;
}
}
return false;
}
}/**
* Time complexity : O(NlogN)
* Space complexity : O(1)
*/
class Solution {
public boolean containsDuplicate(int[] nums) {
Arrays.sort(nums);
for(int i = 1; i < nums.length; i++) {
if(nums[i-1] == nums[i]) {
return true;
}
}
return false;
}
}/**
* Time complexity : O(N)
* Space complexity : O(N)
*/
class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> numsSet = new HashSet();
for(int num: nums) {
if(!numsSet.add(num)) {
return true;
}
}
return false;
}
}