198. Looting - Dynamic Planning

class Solution {
    
public:
    int rob(vector<int>& nums) {
    
        int ans = 0;
        int n = nums.size();
        if(n == 1)  // A special case ： Only 1 Elements 
            return nums[0];
        if(n == 2)  // A special case ： Only 2 Elements 
            return max(nums[0], nums[1]);
        int dp[n];
        dp[0] = nums[0];    //dp[1] It's the first element 
        dp[1] = max(nums[0], nums[1]);  //dp[2] Is the larger of the first two elements 
        for(int i = 2; i < n; i++){
     // The popular formula is , Intrinsic value + Previous   And   Compare with the previous 
            dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[n - 1];
    }
};

Accepted
68/68 cases passed (0 ms)
Your runtime beats 100 % of cpp submissions
Your memory usage beats 73.66 % of cpp submissions (7.4 MB)