issue #11 191-Done

sowon-dev · sowon-dev · commit 863d92b67e5a · 2021-01-24T06:16:32.000+09:00
diff --git a/src/leetcodeEasyLevel/_0190ReverseBits.java b/src/leetcodeEasyLevel/_0190ReverseBits.java
@@ -1,11 +1,14 @@
 package leetcodeEasyLevel;
 
+//How to solve :
+
 public class _0190ReverseBits {
   // you need treat n as an unsigned value
-  public int reverseBits(int n) {
+  public static int reverseBits(int n) {
     int ret=0;
     // because there are 32 bits in total
     for (int i = 0; i <32;i++){
+      //&#48708;&#53944; &#51060;&#46041;&#50672;&#49328;&#51088; <<n: n&#47564;&#53372; &#50812;&#51901;&#51004;&#47196; &#51060;&#46041;
       ret = ret<<1;
       // If the bit is 1 we OR it with 1, ie add 1
       if((n & 1) > 0){
@@ -15,4 +18,9 @@ public int reverseBits(int n) {
     }
     return ret;
   }
+
+  public static void main(String[] args) {
+    String n = "00000010100101000001111010011100";
+    //System.out.println(reverseBits(Integer.parseUnsignedInt(n)));
+  }
 }
diff --git a/src/leetcodeEasyLevel/_0191Numberof1Bits.java b/src/leetcodeEasyLevel/_0191Numberof1Bits.java
@@ -0,0 +1,29 @@
+package leetcodeEasyLevel;
+
+public class _0191Numberof1Bits {
+
+  public static int hammingWeight(int n) {
+    //sol1 Runtime 0 ms Memory 36 MB
+    // >>>n : unsigned &#50864;&#52769; &#49772;&#54532;&#53944; &#50672;&#49328;&#51088;&#45716; &#50724;&#47480;&#54200;&#51004;&#47196; n&#52856;&#50473;&#51060;&#46041;&#54616;&#47728; &#50812;&#54200;&#50640; &#51080;&#45716; &#48512;&#54840;&#50752; &#47924;&#44288;&#54616;&#44172; 0&#51004;&#47196; &#52292;&#50868;&#45796;.
+    int cnt = 0;
+    while(n != 0){
+      if((n&1)==1){
+        cnt ++;
+      }
+      n = n>>>1;
+    }
+
+    return cnt;
+
+    //sol2 Runtime 0 ms Memory 36 MB
+    /*
+    return Integer.bitCount(n);
+     */
+  }
+
+  public static void main(String[] args) {
+    int n = 011101110;
+    System.out.println(hammingWeight(n));
+  }
+}
+
