Update 剑指 Offer II 089. 房屋偷盗.md

杨世超 · 杨世超 · commit ee79e53998e2 · 2022-04-08T15:34:08.000+08:00
diff --git a/Solutions/剑指 Offer II 089. 房屋偷盗.md b/Solutions/剑指 Offer II 089. 房屋偷盗.md
@@ -24,7 +24,7 @@
 
 总结下就是：
 
-$dp[i] = \left\{ \begin{array} {**lr**}  nums[0] & i = 0 \\ max( nums[0], nums[1]) & i = 1 \\ max( dp[i-2] + nums[i], dp[i-1]) & i \ge 2 \end{array} \right.$
+$dp[i] = \left\{ \begin{array} {**lr**}  nums[0] & i = 0 \cr max( nums[0], nums[1]) & i = 1 \cr max( dp[i-2] + nums[i], dp[i-1]) & i \ge 2 \end{array} \right.$
 
 ## 代码
 
