LeetCode-Easy刷题(30) Best Time to Buy and Sell Stock II

Say you have an array for which the i^th element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

一组按照时间顺序的股票价格,可以操作无数次(每次买之前需要卖掉先).如何获取到最大利润

  //累加    public int maxProfit(int[] prices) {        //[7, 1, 5, 3, 6, 4]        int price = 0;        for (int i = 0; i < prices.length-1; i++) {            if(prices[i]<prices[i+1]){//当日买明天卖是否赚钱                price = price +prices[i+1] - prices[i];            }        }        return price;    }