[Leetcode] House Robber
来源:互联网 发布:应用程序端口号 编辑:程序博客网 时间:2024/05/17 04:03
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.
public class Solution { public int rob(int[] nums) { if(nums.length<1) return 0; int sum1=nums[0]; int sum2=nums[0]; int sum3=0; int len=nums.length; if(nums.length==1) return sum1; int lastnumberselected=0; if((nums[1]-nums[0])>0) { lastnumberselected=1; sum2=nums[1]; } if(nums.length==2) return sum2; for(int i=2;i<len;i++) { if(lastnumberselected==0) { sum3=sum2+nums[i]; lastnumberselected=1; } else if((sum1+nums[i])<sum2) sum3=sum2; else { sum3=sum1+nums[i]; lastnumberselected=1; } sum1=sum2; sum2=sum3; } return sum3; }}
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
- Poj 1088 滑雪 (简单DP + 记忆化搜索)
- Codeforces Beta Round #27 (Codeforces format, Div. 2)
- 描述计算机的组成及其功能
- ifconfig命令找不到
- 從零開始學 ReactJS:最完整的 React 生態系入門教程
- [Leetcode] House Robber
- poj2386
- AngularJS ng-checked指令
- leetcode-006 ZigZag Conversion
- 判断两个单链表是否有相同节点
- 阿里大于短信平台 Python3 初体验
- [Leetcode] Bulls and Cows
- git学习
- 最小化安装CentOS7的网卡设置