题解 | #买卖股票的最好时机(一)#

import java.util.*;


public class Solution {
    /**
     * 
     * @param prices int整型一维数组 
     * @return int整型
     */
    public int maxProfit (int[] prices) {
       //k=1
       int n = prices.length;
       int[][] dp = new int[n][2];
       for(int i = 0;i<n;i++){
        if(i-1 == -1){
            dp[i][0] = 0;
            dp[i][1] = -prices[i];
            continue;
        }
        dp[i][0] = Math.max(dp[i-1][0],dp[i-1][1] + prices[i]);
        dp[i][1] = Math.max(dp[i-1][1], - prices[i]);
       }
       return (dp[n-1][0]);
    }
}