Merge pull request #1100 from aa601/main

[yeoju] Week 14

Author: crumbs22

counting-bits/aa601.py

@@ -0,0 +1,10 @@
+'''
+TC: O(n)
+SC: O(n)
+'''
+class Solution:
+    def countBits(self, n: int) -> List[int]:
+        dp = [0] * (n + 1)
+        for num in range(1, n + 1):
+            dp[num] = dp[num // 2] + num % 2
+        return dp

house-robber-ii/aa601.py

@@ -0,0 +1,15 @@
+'''
+TC : O(n)
+SC : O(1)
+'''
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        if len(nums) == 1:
+            return nums[0]
+
+        def dp(start, end):
+            prv, cur = 0, 0
+            for idx in range(start, end):
+                prv, cur = cur, max(prv + nums[idx], cur)
+            return cur
+        return max(dp(1, len(nums)), dp(0, len(nums) - 1))