Sunny-117 / js-challenges

✨✨✨ Challenge your JavaScript programming limits step by step
https://juejin.cn/column/7244788137410560055
2k stars 236 forks source link

最大子数组和 #422

Open Pcjmy opened 1 year ago

OLDLAI commented 1 year ago

var maxSubArray = function(nums) {     let dp = [] ;     dp[0]=nums[0]     let max = nums[0];    for(let i =1; i<nums.length ; i++){         dp[i]=Math.max(dp[i-1]+nums[i],nums[i])         max=Math.max(dp[i],max)     }     return max; };