##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The core idea
At each house, you have two choices: rob it or skip it.
If you rob house i, you can't have robbed i-1. Your total is nums[i] + maxRobbed(i-2).
If you skip house i, your total is maxRobbed(i-1).
dp[i] = max(dp[i-1], dp[i-2] + nums[i]).
Base cases: dp[0] = nums[0], dp[1] = max(nums[0], nums[1]).
