solve problem Single Number III

Author: P-ppc

README.md

@@ -40,6 +40,7 @@ All solutions will be accepted!
 |283|[Move Zeroes](https://leetcode-cn.com/problems/move-zeroes/description/)|[java/py/js](./algorithms/MoveZeroes)|Easy|
 |136|[Single Number](https://leetcode-cn.com/problems/single-number/description/)|[java/py/js](./algorithms/SingleNumber)|Easy|
 |137|[Single Number II](https://leetcode-cn.com/problems/single-number-ii/description/)|[java/py/js](./algorithms/SingleNumberII)|Medium|
+|260|[Single Number III](https://leetcode-cn.com/problems/single-number-iii/description/)|[java/py/js](./algorithms/SingleNumberIII)|Medium|
 |1|[Two Sum](https://leetcode-cn.com/problems/two-sum/description/)|[java/py/js](./algorithms/TwoSum)|Easy|
 |167|[Two Sum II Input Array Is Sorted](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/)|[java/py/js](./algorithms/TwoSumIIInputArrayIsSorted)|Easy|
 |653|[Two Sum IV Input Is A Bst](https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst/description/)|[java/py/js](./algorithms/TwoSumIVInputIsABst)|Easy|

algorithms/SingleNumberIII/README.md

@@ -0,0 +1,2 @@
+# Single Number III
+We can solve problem by bitwise, see [https://blog.csdn.net/qq_35546040/article/details/80284079](https://blog.csdn.net/qq_35546040/article/details/80284079)

algorithms/SingleNumberIII/Solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int[] singleNumber(int[] nums) {
+        int temp = 0,
+            res0 = 0,
+            res1 = 0;
+        
+        for (int num : nums) {
+            temp ^= num;
+        }
+        int v = temp & -temp;
+        
+        for (int num : nums) {
+            if ((v & num) == v) {
+                res0 ^= num;
+            } else {
+                res1 ^= num;
+            }
+        }
+        
+        return new int[]{res0, res1};
+    }
+}

algorithms/SingleNumberIII/solution.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var singleNumber = function(nums) {
+    let temp = res0 = res1 = 0
+    
+    nums.forEach(num => temp ^= num)
+    
+    let v = temp & ~ (temp - 1)
+    
+    nums.forEach(num => {
+        if ((v & num) === v) {
+            res0 ^= num
+        } else {
+            res1 ^= num
+        }
+    })
+    
+    return [res0, res1]
+};

algorithms/SingleNumberIII/solution.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def singleNumber(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        temp = 0
+        
+        for num in nums:
+            temp ^= num
+        
+        # find the value of last 1
+        # or this: v = temp & ~ (tmep - 1)
+        v = temp & -temp
+        
+        res_0 = 0
+        res_1 = 0
+        for num in nums:
+            if v & num == v:
+                res_0 ^= num
+            else:
+                res_1 ^= num
+        
+        return [res_0, res_1]