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

Hide Tags: Array , Greedy

Hide Similar Problems：

　　　(M) Best Time to Buy and Sell Stock

　　　(H) Best Time to Buy and Sell Stock III

　　　(H) Best Time to Buy and Sell Stock IV

题目：可以买卖多次股票，但是买之前必须要将手上的股票卖出。

思路：贪恋算法，只要prices[i+1]＞prices[i]，那么就执行买卖。

int maxProfit(int* prices, int pricesSize) {
    int i = 0;
    int maxprofit = 0;
    for(i=0;i<pricesSize-1;i++)
    {
        if(prices[i+1] > prices[i])
            maxprofit += prices[i+1] - prices[i];
    }
    return maxprofit;
}