From 68b01f809efdab3ac5f334ff80cd6757f42c7073 Mon Sep 17 00:00:00 2001 From: CyC2018 Date: Wed, 28 Oct 2026 22:51:11 +0800 Subject: [PATCH] =?UTF-8?q?Update=20Leetcode=20=E9=A2=98=E8=A7=A3=20-=20?= =?UTF-8?q?=E5=88=86=E6=B2=BB.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 代码经力扣判题验证；示例代码块的语言标注改为 text。 --- notes/Leetcode 题解 - 分治.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/notes/Leetcode 题解 - 分治.md b/notes/Leetcode 题解 - 分治.md index 3fefbb47..cdfd60ed 100644 --- a/notes/Leetcode 题解 - 分治.md +++ b/notes/Leetcode 题解 - 分治.md @@ -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 diffWaysToCompute(String input) { 给定一个数字 n，要求生成所有值为 1...n 的二叉搜索树。 -```html +```text Input: 3 Output: [