House Robber

 1 int dp[1000000];
 2 class Solution {
 3 public:
 4     int rob(vector<int>& nums) {
 5         int i,n=nums.size();
 6         if(n==0)
 7             return 0;
 8         dp[0]=0;
 9         dp[1]=nums[0];
10         for(i=1;i<n;i++)
11         {
12             dp[i+1]=0;
13             dp[i+1]=dp[i]>dp[i-1]+nums[i]?dp[i]:dp[i-1]+nums[i];
14         }
15         return dp[n];
16     }
17 };