LeetCode198. House Robber
2016-02-02 23:52
375 查看
题目链接:
https://leetcode.com/problems/house-robber/题目描述:
题目设计了一个抢劫犯的情景,其实就是求数组中不相邻数据进行组合得到的最大值。思路:
dp[i]为以nums[i]为结尾的序列中不相邻数据组合得到的最大值。当前位置i选不选由i-2,和i-1位置决定。
dp[i]=max(dp[i-2]+nums[i],dp[i-1]);
代码:
class Solution { public: int rob(vector<int>& nums) { int len=nums.size(); if(len==0){ return 0; } int* dp=new int[len]; if(len>0){ dp[0]=nums[0]; if(len>1){ dp[1]=max(dp[0],nums[1]); } } for(int i=2;i<len;i++){ dp[i]=max(dp[i-2]+nums[i],dp[i-1]); } return dp[len-1]; } };
相关文章推荐
- C++动态规划之最长公子序列实例
- C++动态规划之背包问题解决方法
- C#使用动态规划解决0-1背包问题实例分析
- 动态规划
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- C++ 动态规划
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02