LCS, house-robber.

Author: sangbeenmoon

house-robber/sangbeenmoon.py

@@ -14,3 +14,29 @@ def rob(self, nums: List[int]) -> int:
             dp[i] = max(dp[i-2] + nums[i] , dp[i-1])
 
         return dp[len(nums) - 1]
+
+
+
+
+
+# dp[i] = max(dp[i-1], dp[i-2] + num[i])
+# TC : O(n)
+# SC : O(n)
+
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        dp = [0] * len(nums)
+
+        dp[0] = nums[0]
+
+        if len(nums) == 1:
+            return dp[0]
+
+        dp[1] = max(nums[0],nums[1])
+        
+        for i in range(2, len(nums)):
+            dp[i] = max(dp[i-1], dp[i-2] + nums[i])
+        
+        return max(dp)
+
+        

longest-consecutive-sequence/sangbeenmoon.py

@@ -16,3 +16,36 @@ def longestConsecutive(self, nums: List[int]) -> int:
                 answer = max(answer , length)
 
         return answer
+
+
+
+# 정렬하면 쉬운데 O(n)이 필요하네 → set으로 조회를 O(1)로 → 근데 중복으로 세네 → 시작점에서만 세자
+
+# TC : O(n)
+# SC : O(n)
+
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        s = set()
+
+        for num in nums:
+            s.add(num)
+
+        ans = 0
+        
+        for num in s:
+            if num - 1 in s:
+                continue
+            
+            sub_ans = 1
+            next_num = num + 1
+            while next_num in s:
+                sub_ans = sub_ans + 1
+                next_num = next_num + 1
+            ans = max(ans, sub_ans)
+        
+        return ans
+
+            
+
+