LeetCode 198. House Robber

problem link Key ideas: we can not access adjacent index If we don't have this limitation, the optimal amount of money we can rob at a given index is the sum of all the values before this index because of the limitation, the optimal amount of money ...