solve problem Number Complement

Author: P-ppc

README.md

@@ -6,4 +6,5 @@ All solutions will be accepted!
 |:-|:-|:-|:-|
 |771|[Jewels and Stones](https://leetcode-cn.com/problems/jewels-and-stones/description/)|[java/py/js](./algorithms/JewelsAndStones)|Easy|
 |657|[Judge Route Circle](https://leetcode-cn.com/problems/judge-route-circle/description/)|[java/py/js](./algorithms/JudgeRouteCircle)|Easy|
-|461|[Hamming Distance](https://leetcode-cn.com/problems/hamming-distance/description/)|[java/py/js](./algorithms/HammingDistance)|Easy|
+|461|[Hamming Distance](https://leetcode-cn.com/problems/hamming-distance/description/)|[java/py/js](./algorithms/HammingDistance)|Easy|
+|476|[Number Complement](https://leetcode-cn.com/problems/number-complement/description/)|[java/py/js](./algorithms/NumberComplement)|Easy|

algorithms/NumberComplement/README.md

@@ -0,0 +1,3 @@
+# Number Complement
+use bitwise to solve this problem
+becareful the overflow

algorithms/NumberComplement/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int findComplement(int num) {
+        int x = 0x01;
+        while (x <= num && x >= 0) {
+            num = num ^ x;
+            x = x << 1;
+        }
+        return num;
+    }
+}

algorithms/NumberComplement/solution.js

@@ -0,0 +1,12 @@
+/**
+ * @param {number} num
+ * @return {number}
+ */
+var findComplement = function(num) {
+    x = 1
+    while (x <= num && x >= 0) {
+        num = num ^ x
+        x = x << 1
+    }
+    return num
+};

algorithms/NumberComplement/solution.py

@@ -0,0 +1,13 @@
+class Solution(object):
+    def findComplement(self, num):
+        """
+        :type num: int
+        :rtype: int
+        """
+        # use this v to ^
+        x = 1
+        while x <= num:
+            num = num ^ x
+            # move left 1 bit
+            x = x << 1
+        return num