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.
此题不会，动态规划的，没有正确的思路，看了答案了，记下来，明天过来补上
原文：http://www.cnblogs.com/tf-Y/p/4873318.html