Easy : 122. Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II

题目：

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).

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int ret = 0;
        for (int i = 1; i < prices.size(); i++) {
            ret += max(prices[i] - prices[i - 1], 0);
        }
        return ret;
    }
};

解题思路：

• 本题是很简单的一道求股票最大利润的题，采用贪心算法，尽可能多的买卖股票，并且每次只要有盈利的即卖出，然后再买入；而不是等到盈利最大时卖出；
• 时间复杂度O(n)。