LeetCode学习篇十七——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).

难度：medium 通过率：44.8%

这道题在上一篇博客的题目的基础上多了一个条件，可以多次买进和卖出，所以直接使用贪心算法，将每次递增的差异加进变量max_diff，

算法复杂度：O(n)

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