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

删减了309一维数组空间优化的部分注释

Browse Source
This commit is contained in:
LiHua
2021-11-25 21:31:13 +08:00
parent b18f227ffb
commit 1f33812b15
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0309.最佳买卖股票时机含冷冻期.md
View File

@ -189,9 +189,8 @@ class Solution {
// 一维数组优化 // 一维数组优化
class Solution { class Solution {
public int maxProfit(int[] prices) { public int maxProfit(int[] prices) {
// dp[2]和dp[3]用来存储冷冻期的数据
int[] dp=new int[4]; int[] dp=new int[4];
// 0表示持有，1表示卖出
dp[0] = -prices[0]; dp[0] = -prices[0];
dp[1] = 0; dp[1] = 0;
for(int i = 1; i <= prices.length; i++){ for(int i = 1; i <= prices.length; i++){