auto commit
This commit is contained in:
@ -15,7 +15,9 @@
|
||||
|
||||
## 1. 判断是否为二分图
|
||||
|
||||
[785. Is Graph Bipartite? (Medium)](https://leetcode.com/problems/is-graph-bipartite/description/)
|
||||
785\. Is Graph Bipartite? (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/is-graph-bipartite/description/) / [力扣](https://leetcode-cn.com/problems/is-graph-bipartite/description/)
|
||||
|
||||
```html
|
||||
Input: [[1,3], [0,2], [1,3], [0,2]]
|
||||
@ -74,7 +76,9 @@ private boolean isBipartite(int curNode, int curColor, int[] colors, int[][] gra
|
||||
|
||||
## 1. 课程安排的合法性
|
||||
|
||||
[207. Course Schedule (Medium)](https://leetcode.com/problems/course-schedule/description/)
|
||||
207\. Course Schedule (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/course-schedule/description/) / [力扣](https://leetcode-cn.com/problems/course-schedule/description/)
|
||||
|
||||
```html
|
||||
2, [[1,0]]
|
||||
@ -132,7 +136,9 @@ private boolean hasCycle(boolean[] globalMarked, boolean[] localMarked,
|
||||
|
||||
## 2. 课程安排的顺序
|
||||
|
||||
[210. Course Schedule II (Medium)](https://leetcode.com/problems/course-schedule-ii/description/)
|
||||
210\. Course Schedule II (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/course-schedule-ii/description/) / [力扣](https://leetcode-cn.com/problems/course-schedule-ii/description/)
|
||||
|
||||
```html
|
||||
4, [[1,0],[2,0],[3,1],[3,2]]
|
||||
@ -195,7 +201,9 @@ private boolean hasCycle(boolean[] globalMarked, boolean[] localMarked, List<Int
|
||||
|
||||
## 1. 冗余连接
|
||||
|
||||
[684. Redundant Connection (Medium)](https://leetcode.com/problems/redundant-connection/description/)
|
||||
684\. Redundant Connection (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/redundant-connection/description/) / [力扣](https://leetcode-cn.com/problems/redundant-connection/description/)
|
||||
|
||||
```html
|
||||
Input: [[1,2], [1,3], [2,3]]
|
||||
|
Reference in New Issue
Block a user