You are planning robberies on a street where each house stores some cash in nums[i].
Two adjacent houses share a linked alarm system, so robbing both in one night triggers the police.
Return the maximum money you can steal without robbing two neighboring houses.
Examples
Input:[1,2,3,1]
Output:4
Input:[2,7,9,3,1]
Output:12
Hints
dp[i] = max money from first i houses (0-indexed).
At each house: either skip it (dp[i-1]) or rob it (dp[i-2] + nums[i]).