From c0df40dc061e25476dce2304d5b1b99d599e080b Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 13 Oct 2021 13:16:05 +0800
Subject: [PATCH] =?UTF-8?q?217:=E5=AD=98=E5=9C=A8=E9=87=8D=E5=A4=8D?=
 =?UTF-8?q?=E5=85=83=E7=B4=A0(new)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leetcode/editor/cn/ContainsDuplicate.java | 32 +++++++++++++------
 1 file changed, 22 insertions(+), 10 deletions(-)

diff --git a/src/main/java/leetcode/editor/cn/ContainsDuplicate.java b/src/main/java/leetcode/editor/cn/ContainsDuplicate.java
index bef9ce7..654e9e1 100644
--- a/src/main/java/leetcode/editor/cn/ContainsDuplicate.java
+++ b/src/main/java/leetcode/editor/cn/ContainsDuplicate.java
@@ -26,29 +26,41 @@
 
 package leetcode.editor.cn;
 
+import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.HashSet;
 import java.util.Set;
 
 //217:存在重复元素
-class ContainsDuplicate{
+class ContainsDuplicate {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new ContainsDuplicate().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
-class Solution {
-    public boolean containsDuplicate(int[] nums) {
-        Set<Integer> set = new HashSet<>();
-        for (int num : nums) {
-            if (set.contains(num)) {
-                return true;
+    class Solution {
+        //    public boolean containsDuplicate(int[] nums) {
+//        Set<Integer> set = new HashSet<>();
+//        for (int num : nums) {
+//            if (set.contains(num)) {
+//                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)
 
 }
\ No newline at end of file