[leetcode]122. Best Time to Buy and Sell Stock II

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