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