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

http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

Solution:

Pretty simple, just need to find all ascending section. Or try to find all prices[i] that prices[i] > prices[i-1].

https://github.com/starcroce/leetcode/blob/master/best_time_to_buy_and_sell_stock_II.cpp

// 52 ms for 198 test cases
class Solution {
public:
int maxProfit(vector<int> &prices) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int profit = 0;
for(int i = 1; i < prices.size();i++){
int diff = prices[i] - prices[i-1];
if(diff > 0) {
profit += diff;
}
}
return profit;
}
};