【LeetCode】217.Contains Duplicate(Easy)解题报告
题目地址:https://leetcode.com/problems/contains-duplicate/#/description
题目描述:
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.
Solutions:
解法一:
先放一个java8中的方法
public class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> seen = new HashSet<>();
return Arrays.stream(nums).anyMatch(num -> !seen.add(num));
}
}
解法二:
两层循环,肯定超时失败。时间复杂度O(n2),空间复杂度O(1)
public 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[i] == nums[j]) {
return true;
}
}
}
return false;
}
}
解法三:
排序之后,挨着的两两比较,因为leetcode测试数据相对有序,时间性能测试结果很好,但是当数据完全随机,时间复杂度较高。时间复杂度O(nlogn),空间复杂度O(1)
public class Solution {
public boolean containsDuplicate(int[] nums) {
Arrays.sort(nums);
for(int ind = 1; ind < nums.length; ind++) {
if(nums[ind] == nums[ind - 1]) {
return true;
}
}
return false;
}
}
解法四:
使用hashset,较为推荐此法。时间复杂度O(n),空间复杂度O(n)
public class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> distinct = new HashSet<Integer>();
for(int num : nums) {
if(distinct.contains(num)) {
return true;
}
distinct.add(num);
}
return false;
}
}
Date:2017年2月11日