Leetcode House Robber
来源:互联网 发布:99客服软件下载 编辑:程序博客网 时间:2024/06/06 06:42
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 dp[10000];public: int rob(vector<int>& nums) { if(nums.size()==0) return 0; memset(dp,0,sizeof(dp)); dp[0]=nums[0]; dp[1]= nums[0]>nums[1]?dp[0]:nums[1]; for(int i=2;i<nums.size();i++){ dp[i]=max(dp[i-1],dp[i-2]+nums[i]); } return dp[nums.size()-1]; }};
思考了一下,可以不用数组,遍历到n的时候只要知道dp[n-1]以及dp[n-2]的值就可以了。
class Solution {public: int rob(vector<int>& nums) { if(nums.size()==0) return 0; int a = 0; int b = 0; for(int i =0;i<nums.size();i++){ int tmp=b; b=max(b,a+nums[i]); a=tmp; } return b; }};
0 0
- 【dp】Leetcode House Robber&& House Robber II
- 【leetcode】House Robber && House Robber II
- LeetCode --- House Robber & House Robber II
- LeetCode OJ House Robber
- Leetcode: House Robber
- Leetcode 198: House Robber
- House Robber - LeetCode
- LeetCode 之 House Robber
- leetcode--House Robber
- [leetcode]47 House Robber
- [LeetCode] House Robber
- LeetCode :House Robber
- [leetcode] House Robber
- [leetcode]House Robber
- [LeetCode]198.House Robber
- LeetCode House Robber题解
- leetcode:House Robber
- [LeetCode]House Robber
- Handler的机制原理
- Android 使用dalvikvm 执行字节码
- 项目经常使用到的PCH文件设置全项目获取宏或类
- Java:单例模式的七种写法
- c、OC、C++的三种预处理功能
- Leetcode House Robber
- ArrayList、Vector、LinkedList的区别及其优缺点?
- [C++11]_[初级]_[unique_ptr的使用场景]
- centos7网卡配置bond
- 函数简介
- Scala sbt 添加国内镜像
- 作用域
- python BeautifulSoup 库 笔记
- QT的signal和slot的几种常见使用场景