LeetCode-Easy部分中标签为Dynamic Programming *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问题。我现在也没完全理解怎么想出这个题的解题思路，如何分析的。

        //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