LeetCode Problem : Best Time to Buy and Sell Stock II

Problem

Say you have 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 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).

Code

int maxProfit(vector<int> &prices) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
    int n = prices.size();
    if(n < 2)
        return 0;
    for(int i = 0;i < n - 1;++i){
        prices[i] = (prices[i + 1] - prices[i]);
    }
    int max_sum = 0;
    for(int i = 0;i < n - 1;++i){
        if(prices[i] > 0)
            max_sum += prices[i];
    }
    return max_sum;
}