198. House Robber (dp)

198. House Robber

   My Submissions

Question
Editorial Solution

Total Accepted: 68856 Total
Submissions: 199648 Difficulty: Easy

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.
Credits:

Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for
adding additional test cases.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview? 

Yes
 

No

Discuss

class Solution {
public:
int rob(vector<int>& nums) {
memset(dp,0,sizeof(dp));
int len=nums.size();
for(int i=0;i<len;i++)
{
dp[i][0]=0;
dp[i][1]=nums[i];
if(i>=1)
{
dp[i][0]+=max(dp[i-1][0],dp[i-1][1]);
dp[i][1]+=dp[i-1][0];
}
}
int ans=0;
for(int i=0;i<len;i++)
ans=max(max(dp[i][0],dp[i][1]),ans);
return ans;
}
private:
int dp[1005][2];
};