leetcode--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 tonightwithout alerting the police.

[java]  view plain  copy

1. public class Solution {  
2.     public int rob(int[] nums) {  
3.         if(nums.length==0) return 0;  
4.         if(nums.length==1) return nums[0];        
5.         int[] d = new int[nums.length]; //抢到第i家时的最大收益     
6.         d[0] = nums[0];  
7.         d[1] = nums[1]>nums[0]?nums[1]:nums[0];  
8.         for(int i=2;i<nums.length;i++){  
9.             /* 
10.              * 在第i家面前，有两个选择 
11.              * 一是抢，那么你必须保证第i-1没有抢 
12.              * 而是不抢 
13.              */  
14.             d[i] = Math.max(d[i-2]+nums[i],d[i-1]);  
15.         }  
16.         return d[nums.length-1];  
17.     }  
18. } 

原文链接http://blog.csdn.net/crazy__chen/article/details/45440551