huangge1199/leet-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

217:存在重复元素(new)

Browse Source
This commit is contained in:
huangge1199 2021-10-13 13:16:05 +08:00
parent a08f2c7793
commit c0df40dc06
1 changed files with 22 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
src/main/java/leetcode/editor/cn/ContainsDuplicate.java
View File

@ -26,29 +26,41 @@
package leetcode.editor.cn; package leetcode.editor.cn;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet; import java.util.HashSet;
import java.util.Set; import java.util.Set;
//217:存在重复元素 //217:存在重复元素
class ContainsDuplicate{ class ContainsDuplicate {
public static void main(String[] args) { public static void main(String[] args) {
//测试代码 //测试代码
Solution solution = new ContainsDuplicate().new Solution(); Solution solution = new ContainsDuplicate().new Solution();
} }
//力扣代码 //力扣代码
//leetcode submit region begin(Prohibit modification and deletion) //leetcode submit region begin(Prohibit modification and deletion)
class Solution { class Solution {
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) {
if (set.contains(num)) { // if (set.contains(num)) {
return true; // return true;
// }
// set.add(num);
// }
// return false;
// }
public boolean containsDuplicate(int[] nums) {
Arrays.sort(nums);
for (int i = 1; i < nums.length; i++) {
if(nums[i]==nums[i-1]){
return true;
}
} }
set.add(num); return false;
} }
return false;
} }
}
//leetcode submit region end(Prohibit modification and deletion) //leetcode submit region end(Prohibit modification and deletion)
} }