python 动态规划求最优解_动态规划|相邻约束下的最优解(House Robber II )

01

House Robber II

This time, all houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.

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.

房子按圆形排列(第一个房子和最后一个挨着)，约束还是相邻房子不能偷，求偷钱数额最大。

House Robber I 的题目：

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.

相邻房子不能同时偷，求在此约束下，偷n个房子获益的最大值。