【ALGO】买卖股票的最佳时机

1 算法

public class GuPiao {

    public static void main(String[] args) {
        int[] array = new int[]{7, 1, 5, 3, 6, 4};
        // 累加所有的上升期间之和就是 最大收益值
        System.out.println(maxProfit(array));
    }

    public static int maxProfit(int[] prices) {
        int i = 0;
        int valley = prices[0];
        int peak = prices[0];
        int maxprofit = 0;
        while (i < prices.length - 1) {
            while (i < prices.length - 1 && prices[i] >= prices[i + 1])
                i++;
            valley = prices[i];
            while (i < prices.length - 1 && prices[i] <= prices[i + 1])
                i++;
            peak = prices[i];
            maxprofit += peak - valley;
        }
        return maxprofit;
    }
    
    public int maxProfitEasy(int[] prices) {
        int maxprofit = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > prices[i - 1])
                maxprofit += prices[i] - prices[i - 1];
        }
        return maxprofit;
    }
}