update

Author: jackzhenguo

BitManipulation/BitManipulation.suo

@@ -44,6 +44,7 @@
   </ItemGroup>
   <ItemGroup>
     <Compile Include="HammingDistanceSln.cs" />
+    <Compile Include="NumberComplementSln.cs" />
     <Compile Include="PowOfFourSln.cs" />
     <Compile Include="Program.cs" />
     <Compile Include="Properties\AssemblyInfo.cs" />

BitManipulation/BitManipulation/BitManipulation.csproj

@@ -0,0 +1,30 @@
+/* ==============================================================================
+ * 功能描述：NumberComplementSln  
+ * 创 建 者：gz
+ * 创建日期：2017/6/2 13:48:57
+ * ==============================================================================*/
+using System;
+using System.Collections.Generic;
+using System.Diagnostics.CodeAnalysis;
+using System.Linq;
+using System.Text;
+
+namespace BitManipulation
+{
+    /// <summary>
+    ///#476 NumberComplementSln
+    /// </summary>
+    public class NumberComplementSln
+    {
+        public int FindComplement(int num)
+        {
+            int bits = 1; //num including bits
+            while (Math.Pow(2, bits) <= num)
+                bits++;
+            int sum = (int) Math.Pow(2, bits) - 1;//sum =Pow(2,n)-1: sum of n bits 1
+            return  sum - num; //sum - num is the complement
+
+        }
+
+    }
+}

BitManipulation/BitManipulation/NumberComplementSln.cs

@@ -9,8 +9,8 @@ class Program
     {
         static void Main(string[] args)
         {
-            HammingDistanceSln sln = new HammingDistanceSln();
-            int d = sln.HammingDistance(1, 8);
+            NumberComplementSln sln = new NumberComplementSln();
+            int n = sln.FindComplement(6);
         }
     }
 }

BitManipulation/BitManipulation/Program.cs

@@ -3,23 +3,16 @@
 https://github.com/jackzhenguo/LeetCodeManager
 
 ## Bit Mainpulation
-### 461 Hamming Distance
-*  [CSDN:#461 Hamming Distance](http://blog.csdn.net/daigualu/article/details/72830624)
-   > x&(x-1) application; xor application</br>
+*  [CSDN:#476 Number Complement](http://blog.csdn.net/daigualu/article/details/72843822)
+   > get bits for a number</br>
    ```C#
-       public int HammingDistance(int x, int y)
+        public int FindComplement(int num)
         {
-            ///a and y are different bits, so we think the XOR
-            ///think:0001(1D)
-            ///     0100(4D)
-            ///xor = 0101(1D^4D)
-            int dist = 0, xor = x ^ y;
-            while (xor > 0)
-            {
-                ///xor & (xor-1): it sets the rightest 1 bit    to   0 bit of xor.  
-                ++dist;
-                xor = xor & (xor - 1);
-            }
-            return dist;
+            int bits = 1; //num including bits
+            while (Math.Pow(2, bits) <= num)
+                bits++;
+            int sum = (int) Math.Pow(2, bits) - 1;//sum =Pow(2,n)-1: sum of n bits 1
+            return  sum - num; //sum - num is the complement
+
         }
    ```C#

TodayUpdate.md

@@ -92,3 +92,29 @@
 ### 342 Power of Four
 *  [Github:#342 Power of Four](/BitManipulation/PowOfFourSln.cs)
 *  [CSDN:#342 Power of Four](http://blog.csdn.net/daigualu/article/details/72821233)
+
+# `Today Update`
+(Notes: "♥" Welcome to visit or fork or star my LeetCode Manager @
+https://github.com/jackzhenguo/LeetCodeManager
+
+## Bit Mainpulation
+### 461 Hamming Distance
+*  [CSDN:#461 Hamming Distance](http://blog.csdn.net/daigualu/article/details/72830624)
+   > x&(x-1) application; xor application</br>
+   ```C#
+       public int HammingDistance(int x, int y)
+        {
+            ///a and y are different bits, so we think the XOR
+            ///think:0001(1D)
+            ///     0100(4D)
+            ///xor = 0101(1D^4D)
+            int dist = 0, xor = x ^ y;
+            while (xor > 0)
+            {
+                ///xor & (xor-1): it sets the rightest 1 bit    to   0 bit of xor.  
+                ++dist;
+                xor = xor & (xor - 1);
+            }
+            return dist;
+        }
+   ```C#