题目:
122. 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 total = 0;
if(prices.size() <= 1) {
return 0;
}
for(int i = 0; i < prices.size() - 1; i++) {
if(prices[i + 1] > prices[i]) {
total += prices[i + 1] - prices[i];
}
}
return total;
}
};
算法:
题目要求是可以多次买进卖出一份股票,但不能同时进行多个交易,求最大收益。
既相当于求整个序列所有递增序列的差和。