Day51
class Solution {
public int maxProfit(int[] prices) {
int dp[][] = new int[prices.length][3];
dp[0][0] = -prices[0];
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 1; i < prices.length; i++) {
dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][2] - prices[i]);
dp[i][1] = Math.max(Math.max(dp[i - 1][1],dp[i - 1][0] + prices[i]), dp[i - 1][2]);
dp[i][2] = dp[i - 1][1];
}
return Math.max(dp[prices.length - 1][1],dp[prices.length - 1][2]);
}
}
class Solution {
public int maxProfit(int[] prices, int fee) {
int n = prices.length;
int dp[][] = new int[n][2];
dp[0][0] = -prices[0];
dp[0][1] = 0;
for (int i = 1; i < n; i++) {
dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1] - prices[i]);
dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee);
}
return Math.max(dp[n - 1][0], dp[n - 1][1]);
}
}