leetcode[198]:House Robber

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#DP

leetcode 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一个名为HouseRobber的经典动态规划问题。该问题描述了一名窃贼计划抢劫沿街排列的房子，每户人家都有一定数量的钱财。为了不触动报警系统，窃贼不能连续抢劫相邻的两户。文章提供了一种动态规划算法来确定窃贼可以在不触动报警的情况下获得的最大金额。

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

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.

#define  max(a,b) (a>b) ? a : b

int rob(int* nums, int numsSize) {

    int tmp,best0=0,best1=0;
    int i;
    if(numsSize==0) return 0;
    if(numsSize==1) return nums[0];
    best1=nums[0];
    for(i=1;i<numsSize;i++)
    {
        tmp=best1;
        best1=max((best0+nums[i]),best1);
        best0=tmp;
    }
    return best1;
}