198 House Robber

最新推荐文章于 2024-01-18 14:02:27 发布

原创最新推荐文章于 2024-01-18 14:02:27 发布 · 453 阅读

0 ·

CC 4.0 BY-SA版权

c++ 专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个经典的线性规划问题——LeetCode 198抢劫者问题。该问题是关于如何在不触动相邻房屋警报系统的前提下，最大化抢劫金额。通过动态规划的方法，给出了详细的解决方案及C++实现。

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

Leetcode198：

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.

这是一道典型的线性规划问题，假设有n个房子，编号0~n-1，令抢劫第i个房子时已经抢到的钱最多，则:

抢劫第i个房子 f(i) = num[i] + g(i+1)

不抢劫第i个房子 g(i) = max( f(i) , g(i) )

class Solution {
public:
	int rob(vector<int> &num) {
		int f = 0, g = 0, pref = 0, preg = 0, s = 0;
		for (int i = num.size() - 1; i >= 0;i--)
		{
			f = preg + num[i];
			g = max(pref, preg);
			pref = f;
			preg = g;
		}
		return max(f, g);
	}
};