leetcode:198 House Robber-每日编程第二十二题
来源:互联网 发布:百度统计 数据 编辑:程序博客网 时间:2024/06/10 18:55
House Robber
Total Accepted: 44999Total Submissions: 140629 Difficulty: Easy
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.
arr[i]=max(arr[i-2],arr[i-3])+num[i];
class Solution {public: int rob(vector<int>& nums) { int size = nums.size(); if(size==0){ return 0; }else if(size==1){ return nums[0]; }else if(size==2){ return (nums[0]>nums[1]?nums[0]:nums[1]); }else if(size==3){ return ((nums[1]>nums[0]+nums[2])?nums[1]:(nums[0]+nums[2])); } int* arr = new int[size]; arr[0]=nums[0]; arr[1]=nums[1]; arr[2]=nums[0]+nums[2]; for(int i=3;i<size;i++){ arr[i]=nums[i]+(arr[i-2]>arr[i-3]?arr[i-2]:arr[i-3]); } return (arr[size-1]>arr[size-2]?arr[size-1]:arr[size-2]); }};
0 0
- leetcode:198 House Robber-每日编程第二十二题
- 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
- oracle中插入数据时自动生成主键的触发器
- 如何为VMware vcenter server的网卡eth0配置静态IP?
- 布局加载器LayoutInflater讲解
- 访问权限控制总结
- iOS多线程开发——NSOperation/NSOperationQueue浅析
- leetcode:198 House Robber-每日编程第二十二题
- zeros--创建零矩阵
- 关于安卓多线程while(true)方法占用CPU高的原因及其解决方法
- 潍坊长安医院骗患者钱
- POJ 2242|ZOJ 1090 The Circumference of the Circle
- eye--创建单位矩阵
- Masonry 用法小结
- 关于一起互联网如何盈利的随想
- Opencv2.4.9源码分析——HoughLines