class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        n,result=len(prices),0
        for i in range(n-1,0,-1):
            result+=prices[i]-prices[i-1] if prices[i]>prices[i-1] else 0
        return result

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