[Leo] 12th Week solutions (4,5)

Author: leokim0922

jump-game/Leo.py

@@ -0,0 +1,18 @@
+class Solution:
+    def canJump(self, nums: List[int]) -> bool:
+        target = len(nums) - 1
+
+        for i in range(target, -1, -1):
+            if i + nums[i] >= target:
+                target = i
+
+        return True if target == 0 else False
+
+        # maxReach = 0
+        # for i, jump in enumerate(nums):
+        #     if i > maxReach:
+        #         return False
+        #     maxReach = max(maxReach, i + jump)
+        # return True
+
+        ## Both TC: O(n), SC: O(1)

maximum-subarray/Leo.py

@@ -0,0 +1,16 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+
+        maxSub = nums[0]
+        curSum = 0
+
+        for n in nums:
+            if curSum < 0:
+                curSum = 0
+
+            curSum += n
+            maxSub = max(curSum, maxSub)
+
+        return maxSub
+
+        ## TC: O(n), SC: O(1)