Best Time to Buy and Sell Stock II [LeetCode]

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

Basic idea: from code below, it seems super easy. But intuitively, we may use one more variable "tmp_max_profit" to record every times we get the max profit.

class Solution {
public:
int maxProfit(vector<int> &prices) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int max_profit = 0;
for(int i = 0; i < prices.size(); i ++) {
if(i + 1 >= prices.size())
break;

if(prices[i + 1] > prices[i])
max_profit +=  prices[i + 1] - prices[i];
}

return max_profit;
}
};