Commit c8cc5b5

authored

Update 0053.最大子序和.md

增加dp方法

1 parent 90ed55b commit c8cc5b5Copy full SHA for c8cc5b5

File tree

+19

-0

lines changed

+19

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -161,6 +161,25 @@ class Solution {`
`161`	`161`	`}`
`162`	`162`	```
`163`	`163`
	`164`	+```java
	`165`	`+// DP 方法`
	`166`	`+class Solution {`
	`167`	`+ public int maxSubArray(int[] nums) {`
	`168`	`+ int ans = Integer.MIN_VALUE;`
	`169`	`+ int[] dp = new int[nums.length];`
	`170`	`+ dp[0] = nums[0];`
	`171`	`+ ans = dp[0];`
	`172`	`+`
	`173`	`+ for (int i = 1; i < nums.length; i++){`
	`174`	`+ dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);`
	`175`	`+ ans = Math.max(dp[i], ans);`
	`176`	`+ }`
	`177`	`+`
	`178`	`+ return ans;`
	`179`	`+ }`
	`180`	`+}`
	`181`	+```
	`182`	`+`
`164`	`183`	`Python:`
`165`	`184`	```python
`166`	`185`	`class Solution:`

Comments

(0)