leetcode 198: House Robber
来源:互联网 发布:qq游戏 for mac 编辑:程序博客网 时间:2024/06/06 02:48
解题思路:
采用动态规划,设有n栋房子,编号0,1,... ,n-1. nums[i],表示第i栋房子的存钱数目,数组money[n],moeny[i]表示从第0栋房子到第i栋房子,抢劫者可以抢到的最大钱数。则:当 i = 0,money[i] = nums[0];当 i = 1,money[i] = max(nums[0], nums[1]);当 i > 1, money[i] = max(money[i - 2] + nums[i], money[i - 1]);
原题目:
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.
以下为C++代码, AC,菜鸟一个,请大家多多指正
class Solution {public: int rob(vector<int>& nums) { int houseMount = nums.size(); if (houseMount == 0) { return 0; } vector<int> money(houseMount, 0); for (int i = 0; i < houseMount; i++) { if (i == 0) { money[i] = nums[0]; } else if (i == 1) { money[i] = max(nums[0], nums[1]); } else { money[i] = max(money[i - 2] + nums[i], money[i - 1]); } } return money[houseMount - 1]; }};
0 0
- Leetcode 198: House Robber
- leetcode-198 House Robber
- [LeetCode 198]House Robber
- House Robber - LeetCode 198
- leetcode 198 House Robber
- leetCode #198 House Robber
- LeetCode 198-House Robber
- Leetcode[198]-House Robber
- 【Leetcode】House Robber #198
- Leetcode 198 House Robber
- leetcode 198:House Robber
- House Robber (leetcode 198)
- 【LeetCode】198:House Robber
- leetcode[198]:House Robber
- leetcode-198-House Robber
- leetcode 198: House Robber
- [LeetCode 198]House Robber
- Leetcode# 198 House Robber
- spark+hadoop (yarn模式)
- 配置策略 一 系统环境变量自动配置脚本
- 侧滑菜单(Fragment)
- mysql的左连接、右连接和内连接
- C语言笔试题总结
- leetcode 198: House Robber
- Java学习提要——Scanner基础应用
- 字符串函数strcat
- 内存映射文件(MMAP)
- 不借助第三个变量,交换两个变量值的3种方式
- **View Angle
- 网站分析(五)
- python微信机器人
- BZOJ 2456: mode 题解 好小的空间