LeetCode-198. House Robber
来源:互联网 发布:node sass windows 64 编辑:程序博客网 时间:2024/06/03 16:42
问题:https://leetcode.com/problems/house-robber/?tab=Description
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.
你是一个专业强盗,并计划沿街去盗窃每一个住户。每个房子都有一定量的现金,阻止你盗窃的唯一阻碍是相邻的两个房子之间有安全系统。一旦这两个房子同时被盗窃,系统就会自动联系警察。
给定一系列非负整数代表每个房子的金钱,求出再不惊动警察的情况下能盗窃到的最大值。
分析:动态规划问题。hm[i]代表当前第i房子获得的最大值,显然,hm[i]=max{hm[m-1],hm[m-2]+nums[i]}。
C++代码:
class Solution {public: int rob(vector<int>& nums) { int l=nums.size(); if(l==0) return 0; else if(l==1) return nums[0]; else{ vector<int> hm(l,0); hm[0]=nums[0]; hm[1]=max(nums[0],nums[1]); for(int i=2;i<l;i++){ hm[i]=max(hm[i-1],hm[i-2]+nums[i]); } return hm[l-1]; } }};
- [LeetCode]198.House Robber
- 【LeetCode】198. House Robber
- 【LeetCode】198.House Robber
- LeetCode 198. House Robber
- [leetcode] 198.House Robber
- [leetcode] 198. House Robber
- LeetCode:198. House Robber
- 198. House Robber LeetCode
- [LeetCode]198. House Robber
- LeetCode || 198. House Robber
- LeetCode-198. House Robber
- [LeetCode]198. House Robber
- 【LeetCode】198. House Robber
- LeetCode#198. House Robber
- LeetCode 198. House Robber
- leetcode 198. House Robber
- LeetCode *** 198. House Robber
- leetcode 198. House Robber
- 快速排序
- GNU,GPL与POSIX标准
- Mediatek MT2523编译环境
- json 对象
- 基本数据类型和引用数据类型
- LeetCode-198. House Robber
- Java 文件压缩和解压 Zip and Unzip
- HIVE 动态分区与静态分区
- Android 开发问题之使用ScrollView
- winform 子窗体回传参数给父窗体
- 第一行代码学习2(6)
- utorrent下载速度慢
- Mac Intellij IDEA 使用技巧
- Java线程学习笔记之BlockingQueue阻塞队列