# LeetCode-Easy部分中标签为Dynamic Programming *198. House Robber

834人阅读 评论(2)

### 原题

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.

### 代码分析

        //nums = {1, 8, 12 10, 9 }
public int Rob(int[] nums)
{
int inCur = 0; //偷当前房子能获取的最大钱数
int noInCur = 0;//不偷当前的房子能收获的最大钱数
for (int i = 0; i < nums.Length; i++)
{
int tmp = nums[i]+ noInCur; //偷 ith 房子，上一个房子就不能偷
noInCur = Math.Max(inCur, noInCur); //如果不偷 ith 房子，则noInCur 等于偷 i-1 房子和不偷 i-1 房子的最大值
inCur = tmp; //偷当前房子后的获取总钱数
}
return Math.Max(inCur, noInCur);
}


### leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp

3
0

算法channel

交流思想，注重分析，实例阐述，通俗易懂，包含但不限于：经典算法，机器学习，深度学习，LeetCode 题解，Kaggle 实战。期待您的到来！

算法与人工智能交流群：646901659

个人资料
• 访问：319417次
• 积分：7589
• 等级：
• 排名：第3380名
• 原创：350篇
• 转载：1篇
• 译文：0篇
• 评论：58条
博客专栏
 从C++/C#入门到python 文章：11篇 阅读：12175
 SVNAndGit 文章：7篇 阅读：26673