LeetCodeOJ_198_House Robber_e

最新推荐文章于 2021-02-23 16:52:45 发布

小云子93

最新推荐文章于 2021-02-23 16:52:45 发布

阅读量330

点赞数

分类专栏： LeetCodeOJ 文章标签： OJ 算法 C++

本文链接：https://blog.csdn.net/u012482487/article/details/46469235

版权

LeetCodeOJ 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

答题链接

题目:

You are a professionalrobber planning to rob houses along a street. Each house has a certain amountof money stashed, the only constraint stopping you from robbing each of them isthat adjacent houses have security system connected and it will automaticallycontact the police if two adjacent houses were broken into on the same night.

Given a list ofnon-negative integers representing the amount of money of each house, determinethe maximum amount of money you can rob tonight without alerting the police.

分析：

动态规划

代码：

<span style="font-size:14px;">class Solution {
public:
   
    int rob(vector<int>& nums) {
        int unrobSize=nums.size();
        vector<int> robMoney;
        for(int i=0;i<unrobSize;i++)
           robMoney.push_back(0);
        
        if(unrobSize==0)
           return 0;
           
        if(unrobSize>0)
           robMoney[0]=nums.at(0);
           
        if(unrobSize>1)
        {
            if(nums.at(1)>nums.at(0))
               robMoney[1]=nums.at(1);
            else
               robMoney[1]=nums.at(0);
        }
          
        for(int i=2;i<unrobSize;i++)
        {
            
            int robHouse=nums.at(i)+robMoney.at(i-2);
            int unrobHouse=robMoney.at(i-1);
            if(robHouse>unrobHouse)
              robMoney[i]=robHouse;
            else 
              robMoney[i]=unrobHouse;
        }
           
        return robMoney[unrobSize-1];
    }
};
</span>

结果：