Leetcode122. Best Time to Buy and Sell Stock II

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

题目分析：

无论交易次数，但是手上持有的股份最多只有一个，给一个例子，[2,0,1,0,2]，则这个例子中要取得最大的利润，则为3。这道题很明显是要利用贪心算法，去解决。

算法大概：设置一个pre的值，一个sum值，令pre等于nums[0]，然后对nums进行遍历，当遇到nums[i] < pre, 令pre = nums[i]；否则sum += nums[i] - pre, pre = nums[i];

时间复杂度为O（n）。

代码：

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