198. 房子盗贼 House Robber

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.

题意：对一组房子进行盗劫，不能盗劫相邻的房子，求最大收益
解法：使用动态规划求解，维护一个dp数组，递推公式为：Math.Max(dp[i - 1], nums[i] + dp[i - 2]);
  1. public class Solution {
  2.     public int Rob(int[] nums) {
  3.         if (nums.Length == 0) {
  4. 			return 0;
  5. 		} else if (nums.Length == 1) {
  6. 			return nums[0];
  7. 		} else if (nums.Length == 2) {
  8. 			return Math.Max(nums[0], nums[1]);
  9. 		}
  11. 		int[] dp = new int[nums.Length];
  12. 		dp[0] = nums[0];
  13. 		dp[1] = Math.Max(nums[0], nums[1]);
  14. 		for (int i = 2; i < nums.Length; i++) {
  15. 			dp[i] = Math.Max(dp[i - 1], (nums[i] + dp[i - 2]));
  16. 		}
  17. 		return dp[nums.Length - 1];
  18.     }
  19. }





posted @ 2017-02-19 00:30  xiejunzhao  阅读(153)  评论(0)  编辑  收藏  举报