LeetCode 217. 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.

分析：

HashSet？

first try:

import java.util.HashSet;class Solution {public boolean containsDuplicate(int[] nums) {HashSet<Integer> hashSet = new HashSet<Integer>();for(int i=0; i<nums.length; i++) {if(hashSet.contains(nums[i]) ) {return true;} else {hashSet.add(nums[i]);}}return false;}
}

result:

second:

import java.util.HashSet;class Solution {public boolean containsDuplicate(int[] nums) {HashSet<Integer> hashSet = new HashSet<Integer>();for(int i=0; i<nums.length; i++) {int num = nums[i];if(hashSet.contains(num) ) {return true;} else {hashSet.add(num);}}return false;}
}

result:

the same.

third:

import java.util.HashSet;class Solution {public boolean containsDuplicate(int[] nums) {HashSet<Integer> hashSet = new HashSet<Integer>();int length = nums.length;for(int i=0; i<length; i++) {int num = nums[i];if(hashSet.contains(num) ) {return true;} else {hashSet.add(num);}}return false;}
}

result:

anylysis:

看了solution里的代码，并执行了一下，发现比我的代码还慢。

import java.util.HashSet;public class Solution {public boolean containsDuplicate(int[] nums) {Set<Integer> set = new HashSet<Integer>();for (int x: nums) {if (set.contains(x)) {return true;   } else {set.add(x);}}return false;}
}

result:

32.96%

import java.util.HashSet;public class Solution {public boolean containsDuplicate(int[] nums) {Set<Integer> set = new HashSet<Integer>();int length = nums.length;for(int i=0; i<length; i++) {if (set.contains(nums[i])) {return true;   } else {set.add(nums[i]);}}return false;}
}

17.88%

发现慢的原因在于Set，如果是HashSet速度会变快。

for 和foreach循环速度在都是HashSet时没有变化；在是Set时有变化。

发现这种优化费时费力，放弃。

总结：

import java.util.HashSet;

public class Solution {
    public boolean containsDuplicate(int[] nums) {
    Set<Integer> set = new HashSet<Integer>();
    for (int x: nums) {
        if (set.contains(x)) {
            return true;
        } else {
            set.add(x);
        }

    }
    return false;
    }
}

转载于:https://www.cnblogs.com/hzg1981/p/8875514.html

LeetCode 217. Contains Duplicate相关推荐

LeetCode刷题记录2——217. Contains Duplicate（easy）
LeetCode刷题记录2--217. Contains Duplicate(easy) 目录 LeetCode刷题记录2--217. Contains Duplicate(easy) 题目语言思 ...
217. Contains Duplicate - LeetCode
为什么80%的码农都做不了架构师?>>> Question 217. Contains Duplicate Solution 题目大意:判断数组中是否有重复元素思路:构造一个 ...
leetcode python3 简单题217. Contains Duplicate
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二百一十七题 (1)题目英文: Given an array of intege ...
LeetCode【217. Contains Duplicate】
Given an array of integers, find if the array contains any duplicates. Your function should return t ...
LeetCode # Array # Easy # 217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return t ...
LeetCode 217 Contains Duplicate--python,java解法--set--简单
题目地址:Contains Duplicate - LeetCode 题目: Given an array of integers, find if the array contains any du ...
LeetCode 316. Remove Duplicate Letters--贪心--Java,C++,Python解法
题目地址:Number of Longest Increasing Subsequence - LeetCode 做这道题目前建议先做:Longest Increasing Subsequence - ...
LeetCode 287---Find the Duplicate Number
问题链接:LeetCode 287-Find the Duplicate Number 题目大意 : 找出序列中唯一一个重复出现的数字,且只能使用o(1)的额外空间实现代码如下: public cl ...
LeetCode 217、219. 存在重复元素
217. 存在重复元素题目:给你一个整数数组 nums .如果任一值在数组中出现至少两次 ,返回 true :如果数组中每个元素互不相同,返回 false . 链接 https://leetcod ...

LeetCode 217. Contains Duplicate

LeetCode 217. Contains Duplicate相关推荐

最新文章

热门文章