From c179895d7709e6940b07e24e4748e6abcdd3147d Mon Sep 17 00:00:00 2001 From: Jojo Date: Sat, 4 Jan 2020 18:10:44 -0800 Subject: [PATCH] Update 198.house-robber.md --- problems/198.house-robber.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/198.house-robber.md b/problems/198.house-robber.md index 2edb550cc..c294a2b2b 100644 --- a/problems/198.house-robber.md +++ b/problems/198.house-robber.md @@ -67,7 +67,7 @@ for (let i = 0; i < nums.length; i++) { return b; ``` -如上的代码，我们可以将复杂度进行优化，从 O(n)降低到 O(1), +如上的代码，我们可以将空间复杂度进行优化，从 O(n)降低到 O(1), 类似的优化在 DP 问题中不在少数。 > 动态规划问题是递归问题查表，避免重复计算，从而节省时间。