Best Time to Buy and Sell Stock II Total Accepted: 41127 Total Submissions: 108434 My Submissions Question Solution 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.size()==0)return 0;int profit=prices[0];int v=prices[0];for(vector<int>::size_type i=1;i<prices.size();++i){if(prices[i]>v)profit+=prices[i]-v;v=prices[i];}return profit;}};
198 / 198 test cases passed. Status: Accepted Runtime: 18 ms
不要惧怕黑暗，人间没有永恒的夜晚;不要担心严寒，
