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

题目大意: 给定一个表示每天的股价的数组,求出有多次买卖机会下,最大收益。


在股价上升前一天买入股票,计算出每天相对于前一天的收益。当收益为正时,不卖出股票,计算收益,当收益为负时,在前一天卖出股票, 就不用计算亏损(提前卖出,没有造成亏损)。

AC 代码

class Solution {
int maxProfit(vector<int>& prices) {
int profit = 0;
for(int i = 1; i < prices.size(); ++i)
// 计算每天的收益
if(prices[i] - prices[i-1] > 0) profit += (prices[i]-prices[i-1]);
return profit;