[leetcode] Best Time to Buy and Sell Stock II

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

 

比Best Time to Buy and Sell Stock和Best Time to Buy and Sell Stock III都要简单，不需要使用动态规划，只需遍历数组，遇到后一个比前一个大的情况，相减即可。

原理：类似于贪心算法，低价买入，高价卖出。

 

class Solution
{
public:
  int maxProfit(vector<int> prices)
  {
    if(prices.empty())
      return 0;

    int profit = 0;
    for(int i=1; i<prices.size(); i++)
      if(prices[i] > prices[i-1])
        profit += prices[i] - prices[i-1];

    return profit;
  }
};