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

解答：

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

算法上没什么好说的，说一个小细节吧，for循环的第二个条件，即prices.size()前面我加了int类型强制转换，不加则答案错误，原因是prices.size()默认是unsigned型，减1后溢出，变成一个大数值导致错误。如果i初始为1则可以避免对prices.size()进行减操作，或者在循环外，定义int型变量存储prices.size()，之后对该int型变量操作也可以避免类型错误。