摘要:
# 题目
[198. 打家劫舍](https://leetcode-cn.com/problems/house-robber/)
# 解法
$$
fn=
\left\{
\begin{array}{**lr**}
max(f_{n-1}, f_{n-2}+nums[n]), & n\geq 2 \\
nums[0], & n=0 & \\
max(nums[1], nums[0]), & n=1 & \\
\end{array}
\right.
$$ 阅读全文