Best Time to Buy and Sell Stock II ——LeetCode

Say you have an array for which the ith 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).

题目大意：跟上一题类似，都是求最大获利，上一题要求只能买卖一次，这次可以多次买卖。

解题思路：从第2天开始，只要是比前一天价格低就不管，比前一天价格高就卖出。

    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 0) {
            return 0;
        }
        int min_pos = 0;
        int max_pro = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > prices[i - 1]) {
                max_pro += prices[i] - prices[min_pos];
            }
            min_pos = i;
        }
        return max_pro;
    }

 

转载于:https://www.cnblogs.com/aboutblank/p/4409310.html