algorithm/Week_04/id_115/leetcode_309_115.java at master · feixiangcode/algorithm · GitHub

23 lines (18 loc) · 647 Bytes

class Solution {

public int maxProfit(int[] prices) {

if (prices.length<2) return 0;

int buy[]=new int[prices.length];

int sell[]=new int[prices.length];

//day0

buy[0] = -prices[0];

sell[0]= 0;

//day1

buy[1] = Math.max(buy[0],-prices[1]);

sell[1]= Math.max(sell[0],buy[0]+prices[1]);

for(int i =2;i<prices.length;i++){

buy[i] =Math. max( buy[i - 1], sell[i - 2] - prices[i]);

sell[i] =Math. max(sell[i - 1], buy[i - 1] + prices[i]);

}

return sell[prices.length-1];

}

Expand file tree