198. House Robber

最新推荐文章于 2025-04-13 23:45:03 发布

原创最新推荐文章于 2025-04-13 23:45:03 发布 · 194 阅读

0 ·

CC 4.0 BY-SA版权

leetcode代码笔记专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一个模拟夜间抢劫房屋的算法问题。该问题设定为一名专业窃贼计划抢劫沿街的房屋，但相邻房屋的安全系统相互连接，若同一晚被连续闯入会报警。通过给定每个房屋藏匿的金钱数额，算法需找出最大抢劫金额的同时不触发报警。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int rob(vector<int>& nums) {
        int x = 0, y = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (i & 1) {
                x = max(x + nums[i], y);
            } else {
                y = max(y + nums[i], x);
            }
        }
        return max(x, y);
    }
};