Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update Leetcode 题解 - 哈希表.md

Browse Source
This commit is contained in:
Jie Chen 2020-02-03 16:14:40 +08:00 committed by GitHub
parent f84b140418
commit 4a56358678
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
notes/Leetcode 题解 - 哈希表.md
View File

@ -45,13 +45,19 @@ public int[] twoSum(int[] nums, int target) {
[Leetcode](https://leetcode.com/problems/contains-duplicate/description/) / [力扣](https://leetcode-cn.com/problems/contains-duplicate/description/) [Leetcode](https://leetcode.com/problems/contains-duplicate/description/) / [力扣](https://leetcode-cn.com/problems/contains-duplicate/description/)
```java ```java
public boolean containsDuplicate(int[] nums) { public boolean containsDuplicate(int[] nums) {
Set<Integer> set = new HashSet<>(); Set<Integer> set = new HashSet<>();
for (int num : nums) { for (int num : nums) {
set.add(num); set.add(num);
//if set.containsKey(num){
// return true;
//}
//set.add(num);
} }
return set.size() < nums.length; return set.size() < nums.length;
//return false;
} }
``` ```