LeetCode 198. House Robber

最新推荐文章于 2022-03-05 22:30:26 发布

sqyx008

最新推荐文章于 2022-03-05 22:30:26 发布

阅读量316

点赞数

分类专栏： LeetCode 文章标签： leetcode cpp dp

本文链接：https://blog.csdn.net/sqyx008/article/details/66971132

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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.

Analysis

A dynamic programming problem. The key is to control the odd-and-even shift.

Code

class Solution {
public:
    int rob(vector<int>& nums) {
        bool oddOrNot = false;
        int sum_odd = 0,sum_even = 0;
        for (int i : nums){
            if (oddOrNot){
                oddOrNot = false;
                sum_odd = max(sum_even, sum_odd + i);
            }
            else{
                oddOrNot = true;
                sum_even = max(sum_odd, sum_even + i);
            }
        }
        return max(sum_odd,sum_even);
    }
};