198. House Robber

Rob a row of houses for the maximum total, but you can't hit two adjacent ones. This is the DP that everyone points to as the introductory example, and for good reason: the entire problem collapses…