LeetCode 122. Best Time to Buy and Sell Stock II

class Solution {
public:
    int dp[100005];
    int maxProfit(vector<int>& prices) {
        
        int l = prices.size();
        memset(dp,0,sizeof(dp));
        dp[0] = 0;
        for(int i=1;i<l;i++)
        {
            for(int j=i-1;j>=0;j--)
            {
                dp[i]=max(dp[i],prices[i]-prices[j]+(j-1>=0?dp[j-1]:0));
            }
            dp[i]=max(dp[i],dp[i-1]);
        }
        
        return dp[l-1];
        
    }
};