LeetCode:Best Time to Buy and Sell Stock II

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        //在纸上随手写几个数，就会发现只要将相邻的两个数后面的减去前面的得到的如果是正数相加就可以得到所有的利润
        int sum=0;
        int profit;
        int i;
        if(prices.size()<2)
            return 0;
        for(i=1;i<prices.size();i++)
        {
            profit=prices[i]-prices[i-1];
            if(profit>0)
                sum=sum+profit;
        }
        return sum;
    }
};