feat: add python and java solutions to leetcode problem: No.0217

Author: yanglbme

solution/0200-0299/0217.Contains Duplicate/README.md

@@ -35,15 +35,26 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(nums) != len(set(nums))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+        Set<Integer> set = new HashSet<>();
+        for (int e : nums) {
+            if (set.contains(e)) return true;
+            set.add(e);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0217.Contains Duplicate/README_EN.md

@@ -39,13 +39,24 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(nums) != len(set(nums))
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean containsDuplicate(int[] nums) {
+        Set<Integer> set = new HashSet<>();
+        for (int e : nums) {
+            if (set.contains(e)) return true;
+            set.add(e);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0217.Contains Duplicate/Solution.java

@@ -1,13 +1,10 @@
 class Solution {
     public boolean containsDuplicate(int[] nums) {
-        if(nums == null || nums.length == 0) return false;
         Set<Integer> set = new HashSet<>();
-        
-        for(int v : nums) {
-            if(set.contains(v)) return true;
-            set.add(v);
+        for (int e : nums) {
+            if (set.contains(e)) return true;
+            set.add(e);
         }
-        
         return false;
     }
 }

solution/0200-0299/0217.Contains Duplicate/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(nums) != len(set(nums))