Commit 848fbd4

authored

Update 0053.最大子序和.md

1 parent a68ee0f commit 848fbd4Copy full SHA for 848fbd4

File tree

+13

-2

lines changed

+13

-2

lines changed

Lines changed: 13 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -214,6 +214,7 @@ class Solution:`
`214`	`214`	`return result`
`215`	`215`
`216`	`216`	```
	`217`	`+贪心法`
`217`	`218`	```python
`218`	`219`	`class Solution:`
`219`	`220`	`def maxSubArray(self, nums):`
`@@ -226,8 +227,18 @@ class Solution:`
`226`	`227`	`if count <= 0: # 相当于重置最大子序起始位置,因为遇到负数一定是拉低总和`
`227`	`228`	`count = 0`
`228`	`229`	`return result`
`229`		`-`
`230`		`-`
	`230`	+```
	`231`	`+动态规划`
	`232`	+```python
	`233`	`+class Solution:`
	`234`	`+ def maxSubArray(self, nums: List[int]) -> int:`
	`235`	`+ dp = [0] * len(nums)`
	`236`	`+ dp[0] = nums[0]`
	`237`	`+ res = nums[0]`
	`238`	`+ for i in range(1, len(nums)):`
	`239`	`+ dp[i] = max(dp[i-1] + nums[i], nums[i])`
	`240`	`+ res = max(res, dp[i])`
	`241`	`+ return res`
`231`	`242`	```
`232`	`243`	`### Go`
`233`	`244`	`贪心法`

Comments

(0)