122_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).

数组中给定了每天股票价格，通过每天价格计算最大的利润。

贪心算法，计算数组中每个相邻的小段间是否是盈利，然后把数组中每个盈利小段加起来即可。

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