House Robber
来源:互联网 发布:淘宝买复合弓违法吗 编辑:程序博客网 时间:2024/06/06 04:20
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.
解题思路:
递推关系式为:
f(n) = max{nums[n-1]+f(n-2), f(n-1)}
int rob(int num[], int n) {
int a,b,i,temp;if(0 == n) return 0;else if(1 == n) return num[0];else if(2 == n) return (num[0] > num[1]) ? num[0] : num[1];else{ a = num[0]; b = (num[0] > num[1]) ? num[0] : num[1]; for(i = 2; i < n; i++) { temp = b; b = (a + num[i]) > b ? (a + num[i]) : b; a = temp; } return b;}
}
0 0
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- StringBuffer
- Spark on Yarn+Hbase环境搭建指南(一)准备工作
- 2015多校联合第六场hdu5375Gray code
- LintCode-最长无重复字符的子串
- android 动画 从view顶部退出、进入(系列动画)
- House Robber
- 通过Intent将数据传递给上一个活动
- hdu2516
- R语言包_googleVis
- hdoj 2188 悼念512汶川大地震遇难同胞——选拔志愿者 【博弈论&&巴什博弈】
- Matlab函数总结
- NSURLSession 做文件上传
- 2015-09-07 上班第二天
- hdu 1081 To The Max最大矩阵和(动态规划)