Greedy interval problem (4)

A daily topic ing, Today is a day medium topic 122. Best Time to Buy and Sell Stock II

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

	return profit;
    }
};