LeetCode Best Time to Buy and other Stock II, leetcode=

LeetCode Best Time to Buy and other Stock II, leetcode=

Best Time to Buy and Buy 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 your transactions as you like (ie, buy one and every one share of the stock multiple times ). however, you may not engage in multiple transactions at the same time (ie, you must wait the stock before you buy again ).

Question:
If the current value is higher than the Buy value, it is sold and the current stock is bought.
If the current value is lower than the Buy value, discard the previous stock and buy the current stock.

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