Best Time to Buy and Sell Stock II(from leetcode
题意:
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) {
if(prices.empty()){
return 0;
}
int buy = prices[0];
int sell = 0;
int sum = 0;
for(int i=0;i<prices.size()-1;i++){
if(prices[i+1]>prices[i]){
sell = prices[i+1]-prices[i];
sum += sell;
}
if(prices[i+1]<prices[i]){
}
}
return sum;
}
};