LeetCode：122. 买卖股票的最佳时机 II

int maxProfit(int* prices, int pricesSize){
    int result = 0;
    for(int i = 1;i < pricesSize;++i){
        //当前元素大于前一个元素时存在利润
        if(prices[i - 1] < prices[i]){
            result += (prices[i] - prices[i - 1]);
        }
    }
    return result;
}