algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1218 from samwulol/master

Browse Source 
修正【0122-买卖股票的最佳时机II.md】javaScript代码
This commit is contained in:
程序员Carl
2022-05-03 11:22:17 +08:00
committed by GitHub
parent 6877683c95 ac0a0287b8
commit 05c2e5298a
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0122.买卖股票的最佳时机II.md
View File

@ -264,7 +264,7 @@ const maxProfit = (prices) => {
dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i]); dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i]);
} }
return dp[prices.length -1][0]; return dp[prices.length -1][1];
}; };
``` ```

2
problems/0122.买卖股票的最佳时机II（动态规划）.md
View File

@ -276,7 +276,7 @@ const maxProfit = (prices) => {
dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i]); dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i]);
} }
return dp[prices.length -1][0]; return dp[prices.length -1][1];
}; };
// 方法二：动态规划（滚动数组） // 方法二：动态规划（滚动数组）