198.[Leetcode]House Robber
来源:互联网 发布:不喜欢知否的男主 编辑:程序博客网 时间:2024/06/06 02:50
题意:
给定一串数字,让你选择其中一些数字,选的数字不能相邻,那么选的数字的最大和是多少?
我的解法:
这又是一个典型的动态规划求最优的问题,但是一开始我还是没有想明白。简单的说就是这一个公式:
max_sum(i) = max(max_sum(i-2) + nums[i], max_sum(i-1))
java代码如下:
// 明显是动态规划的问题public class Solution { public int rob(int[] nums) { if(nums.length == 0) return 0; if(nums.length == 1) return nums[0]; if(nums.length == 2) return Math.max(nums[0],nums[1]); //以上是边际情况 int maxi_2 = nums[0]; int maxi_1 = Math.max(nums[0],nums[1]); for(int i=2; i<nums.length; i++){ if(maxi_2 + nums[i] > maxi_1) { int temp = maxi_2; maxi_2 = maxi_1; maxi_1 = temp + nums[i]; } else { maxi_2 = maxi_1; maxi_1 = maxi_1; } } return maxi_1; }}
0 0
- [LeetCode]198.House Robber
- 【LeetCode】198. House Robber
- 【LeetCode】198.House Robber
- LeetCode 198. House Robber
- [leetcode] 198.House Robber
- [leetcode] 198. House Robber
- LeetCode:198. House Robber
- 198. House Robber LeetCode
- [LeetCode]198. House Robber
- LeetCode || 198. House Robber
- LeetCode-198. House Robber
- [LeetCode]198. House Robber
- 【LeetCode】198. House Robber
- LeetCode#198. House Robber
- LeetCode 198. House Robber
- leetcode 198. House Robber
- LeetCode *** 198. House Robber
- leetcode 198. House Robber
- 轻松制作GIF动画!教你玩转PS时间轴之进阶技巧篇
- memcache安装及使用详解
- [Leetcode] 13. Roman to Integer
- python里面的函数
- sqoop mysql to hbase java api 1.4.5
- 198.[Leetcode]House Robber
- 控制seekBar的进度颜色
- Java语言学习
- This version of the rendering library is more recent than your version of Android Studio. Please upd
- Windows NTP服务配置
- Java Web前端到后台常用框架介绍
- Hadoop旧mapreduce的map任务切分原理
- SQL 优化原则
- [渗透测试] VULNERABILITY SEARCHING