Implement Q53

wshs0713 · Nov 16, 2021 · 32ed19f · 32ed19f
1 parent 6e433bd
commit 32ed19f
Show file tree

Hide file tree

Showing 3 changed files with 24 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -28,6 +28,10 @@ My Leetcode practice.
 
 ## Dynamic Programming
 
+### Easy
+
+- [53. Maximum Subarray](/dynamic_programming/53_maximum_subarray.md)
+
 ## Graph
 
 ## Tree
diff --git a/dynamic_programming/.gitkeep b/dynamic_programming/.gitkeep
diff --git a/dynamic_programming/53_maximum_subarray.md b/dynamic_programming/53_maximum_subarray.md
@@ -0,0 +1,20 @@
+# \[Easy\] 53. Maximum Subarray
+
+## Question
+
+[\[Easy\] 53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)
+
+## Thought
+
+Dynamic programming
+
+## Code
+
+```python
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        for i in range(1, len(nums)):
+            nums[i] = max(nums[i] + nums[i-1], nums[i])
+
+        return max(nums)
+```