zoukankan      html  css  js  c++  java
  • House Robber

    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.

     Dynamic Programming
    这道题的本质相当于在一列数组中取出一个或多个不相邻数,使其和最大。那么我们对于这类求极值的问题首先考虑动态规划Dynamic Programming来解,我们维护一个一位数组dp,其中dp[i]表示到i位置时不相邻数能形成的最大和,经过分析,我们可以得到递推公式dp[i] = max(num[i] + dp[i - 2], dp[i - 1]), 由此看出我们需要初始化dp[0]和dp[1],其中dp[0]即为num[0],dp[1]此时应该为max(num[0], num[1]),代码如下:
    #include<iostream>
    #include<vector>
    using namespace std;
    
    class Solution {
    public:
        int rob(vector<int> &num) {
            if(num.empty())
                return 0;
            int n=num.size();
            if(n==1)
                return num[n-1];
            int dp[n];
            dp[0]=num[0];
            dp[1]=max(num[1],num[0]);
            for(int i=2;i<n;i++)
            {
                dp[i]=max(dp[i-1],num[i]+dp[i-2]);
            }
            return dp[n-1];
        }
    };
    
    int main()
    {
        Solution s;
        vector<int> vec{1,1,1,2};
        cout<<s.rob(vec)<<endl;
    
    }
     
  • 相关阅读:
    Hibernate知识回顾
    Lucene搜索过程的核心类
    JSP知识回顾
    Java Swing 知识回顾
    Spring知识回顾
    javaDocking 学习
    Lucene搜索范围
    MINA 学习
    java 阿拉伯人民币转换为中文
    oracle提高查询效率方法
  • 原文地址:https://www.cnblogs.com/wuchanming/p/4393154.html
Copyright © 2011-2022 走看看