zoukankan      html  css  js  c++  java
  • 【LeetCode】198. House Robber

    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.

    Credits:
    Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

    动态规划,设置maxV[i]表示到第i个房子位置,最大收益。

    递推关系为maxV[i] = max(maxV[i-2]+num[i], maxV[i-1])

    注:可能会对上述递推关系产生疑问,是否存在如下可能性,maxV[i-1]并不含num[i-1]?

    结论是,在这种情况下maxV[i-1]等同于maxV[i-2],因此前者更大。

    class Solution {
    public:
        int rob(vector<int> &num) {
            int n = num.size();
            if(n == 0)
                return 0;
            else if(n == 1)
                return num[0];
            else
            {
                vector<int> maxV(n, 0);
                maxV[0] = num[0];
                maxV[1] = max(num[0], num[1]);
                for(int i = 2; i < n; i ++)
                    maxV[i] = max(maxV[i-2]+num[i], maxV[i-1]);
                return maxV[n-1];
            }
        }
    };

  • 相关阅读:
    python的元类
    中国的互联网:草根与精英
    PEP8中文翻译
    一些重要的算法
    tornado模板语法
    C#l类与对象
    sql_ 存储过程
    SQL_触发器
    SQL_事务处理
    C#_方法
  • 原文地址:https://www.cnblogs.com/ganganloveu/p/4417485.html
Copyright © 2011-2022 走看看