feat: update solutions to leetcode problem: No.0191

Author: yanglbme

lcof/面试题15. 二进制中1的个数/README.md

@@ -32,6 +32,8 @@
 
 `n & (n - 1)` 会消除 n 中最后一位中的 1。
 
+同 [LeetCode 191. 位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md)
+
 <!-- tabs:start -->
 
 ### **Python3**

solution/0100-0199/0191.Number of 1 Bits/README.md

@@ -47,22 +47,59 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+`n & (n - 1)` 会消除 n 中最后一位中的 1。
+
+同 [剑指 Offer 15. 二进制中 1 的个数](/lcof/面试题15.%20二进制中1的个数/README.md)
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        res = 0
+        while n:
+            n &= (n - 1)
+            res += 1
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+public class Solution {
+    // you need to treat n as an unsigned value
+    public int hammingWeight(int n) {
+        int res = 0;
+        while (n != 0) {
+            n &= (n - 1);
+            ++res;
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n - a positive integer
+ * @return {number}
+ */
+var hammingWeight = function (n) {
+  let res = 0;
+  while (n) {
+    n &= n - 1;
+    ++res;
+  }
+  return res;
+};
 ```
 
 ### **...**

solution/0100-0199/0191.Number of 1 Bits/README_EN.md

@@ -64,13 +64,46 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        res = 0
+        while n:
+            n &= (n - 1)
+            res += 1
+        return res
 ```
 
 ### **Java**
 
 ```java
+public class Solution {
+    // you need to treat n as an unsigned value
+    public int hammingWeight(int n) {
+        int res = 0;
+        while (n != 0) {
+            n &= (n - 1);
+            ++res;
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n - a positive integer
+ * @return {number}
+ */
+var hammingWeight = function (n) {
+  let res = 0;
+  while (n) {
+    n &= n - 1;
+    ++res;
+  }
+  return res;
+};
 ```
 
 ### **...**

solution/0100-0199/0191.Number of 1 Bits/Solution.java

@@ -1,5 +1,11 @@
 public class Solution {
+    // you need to treat n as an unsigned value
     public int hammingWeight(int n) {
-        return Integer.bitCount(n);
+        int res = 0;
+        while (n != 0) {
+            n &= (n - 1);
+            ++res;
+        }
+        return res;
     }
-}
+}

solution/0100-0199/0191.Number of 1 Bits/Solution.js

@@ -1,8 +1,12 @@
-const hammingWeight = function (n) {
-  let result = 0;
+/**
+ * @param {number} n - a positive integer
+ * @return {number}
+ */
+var hammingWeight = function (n) {
+  let res = 0;
   while (n) {
-    result += n & 1;
-    n = n >>> 1;
+    n &= n - 1;
+    ++res;
   }
-  return result;
+  return res;
 };

solution/0100-0199/0191.Number of 1 Bits/Solution.py

@@ -1,8 +1,7 @@
-class Solution(object):
-    def hammingWeight(self, n):
-        """
-        :type n: int
-        :rtype: int
-        """
-        
-        return bin(n).count("1")
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        res = 0
+        while n:
+            n &= (n - 1)
+            res += 1
+        return res