g0101_0200.s0198_house_robber.Solution.cpp Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
// #2024_05_26_Time_2_ms_(40.41%)_Space_9.2_MB_(58.86%)

#include 
#include 

class Solution {
public:
    int rob(std::vector& nums) {
        if (nums.empty()) {
            return 0;
        }
        if (nums.size() == 1) {
            return nums[0];
        }
        if (nums.size() == 2) {
            return std::max(nums[0], nums[1]);
        }
        
        std::vector profit(nums.size());
        profit[0] = nums[0];
        profit[1] = std::max(nums[0], nums[1]);
        
        for (size_t i = 2; i < nums.size(); ++i) {
            profit[i] = std::max(profit[i - 1], nums[i] + profit[i - 2]);
        }
        
        return profit.back();
    }
};