1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int sum = 0;
        if(prices.size() <= 0)
            return sum;
        vector<int> dis(prices.size()-1);
        for(int i = 1;i < prices.size();i++)
        {
            dis[i-1] = prices[i] - prices[i-1];
        }
        for(int i = 0;i < dis.size();i++)
        {
            if(dis[i] > 0)
            {
                sum += dis[i];
            }
        }
        return sum;
    }
};