[LeetCode]198 House Robber

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

class Solution { public: int rob(vector<int>& nums) { constexpr int SIZE = 101; int dp[SIZE]; if (nums.size() == 1) return nums[0]; dp[0] = nums[0]; dp[1] = max(nums[0], nums[1]); for (int i = 2; i < nums.size(); i++) dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]); return dp[nums.size() - 1]; } };