Robbery

There are couple of houses on a street, where each house has some non-negative amount of money.

Write a method to find the maximum amount of money you can rob.You cannot rob any two adjacent houses otherwise you will be caught. Use Dynamic Programming!

---

Examples:

robbery({20, 25, 50, 62, 12, 20, 20}) ==> 107

robbery({40, 25, 25, 30}) ==>70