mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 08:50:15 +08:00
Merge pull request #1124 from huodoushigemi/master
0053.最大子序和(动态规划) JS代码修正
This commit is contained in:
@ -174,6 +174,7 @@ const maxSubArray = nums => {
|
|||||||
// 数组长度,dp初始化
|
// 数组长度,dp初始化
|
||||||
const len = nums.length;
|
const len = nums.length;
|
||||||
let dp = new Array(len).fill(0);
|
let dp = new Array(len).fill(0);
|
||||||
|
dp[0] = nums[0];
|
||||||
// 最大值初始化为dp[0]
|
// 最大值初始化为dp[0]
|
||||||
let max = dp[0];
|
let max = dp[0];
|
||||||
for (let i = 1; i < len; i++) {
|
for (let i = 1; i < len; i++) {
|
||||||
|
Reference in New Issue
Block a user