Update Leetcode 题解 - 分治.md

代码经力扣判题验证；示例代码块的语言标注改为 text。
2026-10-31 11:05:36 +00:00 · 2026-10-28 22:51:11 +08:00
parent 7c154cff59
commit 68b01f809e
1 changed files with 2 additions and 2 deletions
@@ -12,7 +12,7 @@

 [Leetcode](https://leetcode.com/problems/different-ways-to-add-parentheses/description/) / [力扣](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/description/)

-```html
+```text
 Input: "2-1-1".

 ((2-1)-1) = 0
@@ -61,7 +61,7 @@ public List<Integer> diffWaysToCompute(String input) {

 给定一个数字 n，要求生成所有值为 1...n 的二叉搜索树。

-```html
+```text
 Input: 3
 Output:
 [