feat: add python solution to leetcode problem: 0136. Single Number

yanglbme · yanglbme · commit 0bef15eab5a6 · 2020-08-06T21:19:58.000+08:00
diff --git a/solution/0100-0199/0136.Single Number/README.md b/solution/0100-0199/0136.Single Number/README.md
@@ -26,21 +26,37 @@
 ## 解法
 <!-- 这里可写通用的实现逻辑 -->
 
+异或运算求解。
+
+首先明确，两个相同的数异或之后的结果为 0。对该数组所有元素进行异或运算，结果就是那个只出现一次的数字。
 
 <!-- tabs:start -->
 
 ### **Python3**
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def singleNumber(self, nums: List[int]) -> int:
+        res = 0
+        for num in nums:
+            res ^= num
+        return res
 ```
 
 ### **Java**
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int singleNumber(int[] nums) {
+        int res = 0;
+        for (int num : nums) {
+            res ^= num;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/0100-0199/0136.Single Number/README_EN.md b/solution/0100-0199/0136.Single Number/README_EN.md
@@ -52,13 +52,26 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def singleNumber(self, nums: List[int]) -> int:
+        res = 0
+        for num in nums:
+            res ^= num
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int singleNumber(int[] nums) {
+        int res = 0;
+        for (int num : nums) {
+            res ^= num;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**
diff --git a/solution/0100-0199/0136.Single Number/Solution.py b/solution/0100-0199/0136.Single Number/Solution.py
@@ -1,10 +1,6 @@
 class Solution:
-    def singleNumber(self, nums):
-        """
-        :type nums: List[int]
-        :rtype: int
-        """
-        res=0
-        for i in nums:
-            res = res^i
-        return res
+    def singleNumber(self, nums: List[int]) -> int:
+        res = 0
+        for num in nums:
+            res ^= num
+        return res
