From 7c154cff592b6eb9641e015b5cce1c40c4a0ba3c 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=9B=BE.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 代码经力扣判题验证；示例代码块的语言标注改为 text。 --- notes/Leetcode 题解 - 图.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/notes/Leetcode 题解 - 图.md b/notes/Leetcode 题解 - 图.md index 4fe635d5..cbd6dbbd 100644 --- a/notes/Leetcode 题解 - 图.md +++ b/notes/Leetcode 题解 - 图.md @@ -21,7 +21,7 @@ [Leetcode](https://leetcode.com/problems/is-graph-bipartite/description/) / [力扣](https://leetcode-cn.com/problems/is-graph-bipartite/description/) -```html +```text Input: [[1,3], [0,2], [1,3], [0,2]] Output: true Explanation: @@ -33,7 +33,7 @@ The graph looks like this: We can divide the vertices into two groups: {0, 2} and {1, 3}. ``` -```html +```text Example 2: Input: [[1,2,3], [0,2], [0,1,3], [0,2]] Output: false @@ -82,12 +82,12 @@ private boolean isBipartite(int curNode, int curColor, int[] colors, int[][] gra [Leetcode](https://leetcode.com/problems/course-schedule/description/) / [力扣](https://leetcode-cn.com/problems/course-schedule/description/) -```html +```text 2, [[1,0]] return true ``` -```html +```text 2, [[1,0],[0,1]] return false ``` @@ -142,7 +142,7 @@ private boolean hasCycle(boolean[] globalMarked, boolean[] localMarked, [Leetcode](https://leetcode.com/problems/course-schedule-ii/description/) / [力扣](https://leetcode-cn.com/problems/course-schedule-ii/description/) -```html +```text 4, [[1,0],[2,0],[3,1],[3,2]] There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is [0,1,2,3]. Another correct ordering is[0,2,1,3]. ``` @@ -207,7 +207,7 @@ private boolean hasCycle(boolean[] globalMarked, boolean[] localMarked, List