2017/3/31

XingwenZhang · XingwenZhang · commit 030b3834e80f · 2017-03-31T11:49:21.000-07:00
diff --git a/No191_Numberof1Bits.cpp b/No191_Numberof1Bits.cpp
@@ -0,0 +1,20 @@
+// Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).
+
+// For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.
+
+
+class Solution {
+public:
+	// Right shift and count
+    int hammingWeight(uint32_t n) {
+        int res = 0;
+        
+        while(n!=0){
+        	if(n&1){
+        		res++;
+        	}
+        	n = n>>1;
+        }
+        return res;
+    }
+};
