<LeetCode><Easy> 198 House Robber
来源:互联网 发布:网络会计授课教师招聘 编辑:程序博客网 时间:2024/05/29 02:41
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.
1.递归
#Python2 TimeOut
class Solution(object): def rob(self, nums): if nums==[]: return 0 def maxMoney(ns): if len(ns)>3: return max(ns[0]+maxMoney(ns[2:]),ns[1]+maxMoney(ns[3:])) else: if len(ns)==3: return max(ns[0]+ns[2],ns[1]) elif len(ns)==3: return max(ns[0],ns[1]) else: return ns[0] return maxMoney(nums)
0 0
- [Leetcode 198, Easy] House Robber
- <LeetCode><Easy> 198 House Robber
- 【Leetcode-Easy-198】House Robber
- LeetCode 198. House Robber (Easy)
- Easy 198题 House Robber
- leetcode 198 House Robber(难易度:Easy)
- 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)
- (php)类、接口、空间、序列化、PDO
- 【LeetCode】 Add Digits 解题报告
- HDU1240 - Asteroids! (广搜)
- 如何搭建自己的个人技术博客网站
- 001-iOS开发前奏-C语言笔记
- <LeetCode><Easy> 198 House Robber
- bzoj1798【ahoi2009】维护序列
- Ubuntu下开发Android配置流程
- 002-IDE的使用与数据类型-C语言笔记
- iOS开发中遇到的几种crash
- 显示和设置ProgressBar的进度
- 003-scanf函数使用和表达式-C语言笔记
- Universal Image Loader库使用方法
- 自定义spinner下拉框样式,并实现三级联动