[LeetCode9]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).

Analysis:

A bit different with previous one. Since we can make unlimited transactions, this question turns to sum all the positive price difference.
So, scan from left to right, and add all positive diff value.

Java

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

c++

int maxProfit(vector<int> &prices) {        int sum = 0;    for(int i=1;i<prices.size();i++){        if(prices[i]-prices[i-1] > 0)            sum+= prices[i]-prices[i-1];    }    return sum;    }