[Leetcode]198. House Robber
来源:互联网 发布:steam游戏推荐软件 编辑:程序博客网 时间:2024/06/04 18:23
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.
class Solution {public: int rob(vector<int>& nums) { int n = nums.size(); if (n == 0) return 0; if (n == 1) return nums[0]; vector<int> maxMon(n, 0); maxMon[0] = nums[0]; maxMon[1] = max(nums[0], nums[1]); for (int i = 2; i != n; ++i) maxMon[i] = max(maxMon[i - 1], maxMon[i - 2] + nums[i]); return maxMon[n - 1]; }};
0 0
- [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
- ubuntu12.04 vim的vundle插件安装方法
- 织梦dedecms SQL语句批量清除注册会员信息
- ThreadLocal和线程同步机制的比较
- Apache禁止目录的自动目录列表(安全性)
- 华为OJ 初级:计算字符个数
- [Leetcode]198. House Robber
- Android中Service使用bindService
- ALE&IDoc& EDI(1)--OverView
- Android GridView属性集合
- C++ 学习总结
- Longest Common Prefix
- 655635
- ALE&IDoc& EDI(2)--一般流程
- Mahout推荐开发总结