[Leetcode] 122-best time to Buy and Sell Stock II

Say you has an array for which the i-th element is the price of a given-stock on day I.

Design an algorithm to find the maximum profit. You could complete as many transactions as (ie, buy one and sell one share of the stock multiple times). However, engage in multiple transactions for the same time (ie, you must sell the stock before you buy again).

Class Solution {
Public
int Maxprofit (vector<int>& prices) {
int res = 0;
int size = Prices.size ();
if (size <= 1) {
return res;
}
for (int i = 1; i < size; ++i) {
if (Prices[i] > Prices[i-1]) {
Res + = Prices[i]-prices[i-1];
}
}
return res;
}
};

[Leetcode] 122-best time to Buy and Sell Stock II