mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
fix: 0053.最大子序和原typescript过不了leetcode,更新代码逻辑
This commit is contained in:
@ -226,18 +226,20 @@ object Solution {
|
|||||||
|
|
||||||
```typescript
|
```typescript
|
||||||
function maxSubArray(nums: number[]): number {
|
function maxSubArray(nums: number[]): number {
|
||||||
/**
|
const len = nums.length
|
||||||
dp[i]:以nums[i]结尾的最大和
|
if (len === 1) return nums[0]
|
||||||
*/
|
|
||||||
const dp: number[] = []
|
const dp: number[] = new Array(len)
|
||||||
dp[0] = nums[0];
|
let resMax: number = dp[0] = nums[0]
|
||||||
let resMax: number = 0;
|
|
||||||
for (let i = 1; i < nums.length; i++) {
|
for (let i = 1; i < len; i++) {
|
||||||
dp[i] = Math.max(dp[i - 1] + nums[i], nums[i]);
|
dp[i] = Math.max(dp[i - 1] + nums[i], nums[i])
|
||||||
resMax = Math.max(resMax, dp[i]);
|
// 注意值为负数的情况
|
||||||
|
if (dp[i] > resMax) resMax = dp[i]
|
||||||
}
|
}
|
||||||
return resMax;
|
|
||||||
};
|
return resMax
|
||||||
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user