Merge pull request #1949 from s0ooo0k/main

[s0ooo0k] Week 14 Solutions

Author: SamTheKorean

counting-bits/s0ooo0k.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int[] countBits(int n) {
+        int[] arr = new int[n + 1];
+        
+        for (int i = 1; i <= n; i++) {
+            arr[i] = arr[i >> 1] + (i & 1);
+        }
+        
+        return arr;
+    }
+}
+

missing-number/s0ooo0k.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int missingNumber(int[] nums) {
+        int n = nums.length;
+        boolean[] dp = new boolean[n+1];
+
+        for(int i=0; i<n; i++) {
+            dp[nums[i]]=true;
+        }
+
+        for(int i=0; i<=n; i++) {
+            if(dp[i]==false) return i;
+        }
+        return 0;
+    }
+}
+