Merge pull request #1957 from CodingTestStudy2/염혜정

[염혜정] Day02

Author: github-actions[bot]

leetcode3/염혜정/3827. Count Monobit Integers.java

@@ -0,0 +1,14 @@
+// 0을 제외하고 1, 11, 111, 1111... (2^1 - 1, 2^2 - 1, 2^3 -1)
+// o(log n)
+
+class Solution {
+    public int countMonobit(int n) {
+        int cnt = 1; // 0은 무조건 포함
+        int num = 1;
+        while (num <= n) {
+            cnt++;
+            num = num * 2 + 1;
+        }
+        return cnt;
+    }
+}