zoukankan      html  css  js  c++  java
  • 198. 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.

    Example 1:

    Input: [1,2,3,1]
    Output: 4
    Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
      Total amount you can rob = 1 + 3 = 4.
    Example 2:

    Input: [2,7,9,3,1]
    Output: 12
    Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
      Total amount you can rob = 2 + 9 + 1 = 12.

    来源:力扣(LeetCode)
    链接:https://leetcode-cn.com/problems/house-robber

    1.要考虑输入为空的情况

    if (nums.empty())return 0;
    
    class Solution {
    public:
        int rob(vector<int>& nums) {
            if (nums.empty()){
                return 0;
            }
    
            int n = nums.size();
            int dp[n];
            dp[0] = nums[0];
            for (int i=1;i<n;i++){
                if (i==1){
                    dp[1] = max(nums[0],nums[1]);
                }
                else{
                    dp[i] = max(dp[i-2] + nums[i], dp[i-1]);
                }
            }
             return dp[n-1];
        }
    };
  • 相关阅读:
    小议如何使用APPLY
    SQLServer复制(二)--事务代理作业
    T-SQL—理解CTEs
    jdbc与java.sql
    java设计模式之中介者模式
    fread函数和fwrite函数
    Linux多线程编程(不限Linux)
    poj 3320 技巧/尺取法 map标记
    poj 1260 dp
    HDU 4311 前缀和
  • 原文地址:https://www.cnblogs.com/xgbt/p/12988009.html
Copyright © 2011-2022 走看看