动态规划之House Robber和爬楼梯问题

1. House Robber

1.1 原题目

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

题意：

你是一个专业的强盗，你计划在一条路上抢劫房屋。每一个房屋藏着一些钱。因为相邻房屋之间有安全系统相连，这个安全系统又与警察相连，所以你不能抢劫相邻的房屋在同一个晚上。
给你一列非负整数代表每一个房屋的藏的钱数，求出在没有惊扰警察的情况下，能抢劫到的最多的钱数。

注意：不能取相邻的元素哈~

原题链接