Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 6f9a63e

Browse files
author
johnnyumr
committed
check finished
1 parent b70881e commit 6f9a63e

File tree

3 files changed

+18
-18
lines changed

3 files changed

+18
-18
lines changed

‎data_structure/binary_tree.md‎

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -773,12 +773,12 @@ func insertIntoBST(root *TreeNode, val int) *TreeNode {
773773

774774
## 练习
775775

776-
- [] [maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)
777-
- [] [balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/)
778-
- [] [binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)
779-
- [] [lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)
780-
- [] [binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)
781-
- [] [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)
782-
- [] [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)
783-
- [] [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/)
784-
- [] [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)
776+
- [X] [maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)
777+
- [X] [balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/)
778+
- [X] [binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)
779+
- [X] [lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)
780+
- [X] [binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)
781+
- [X] [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)
782+
- [X] [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)
783+
- [X] [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/)
784+
- [X] [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)

‎data_structure/linked_list.md‎

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -573,13 +573,13 @@ func copyRandomList(head *Node) *Node {
573573

574574
## 练习
575575

576-
- [] [remove-duplicates-from-sorted-list](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)
577-
- [] [remove-duplicates-from-sorted-list-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/)
578-
- [] [reverse-linked-list](https://leetcode-cn.com/problems/reverse-linked-list/)
579-
- [] [reverse-linked-list-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/)
580-
- [] [merge-two-sorted-lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/)
581-
- [] [partition-list](https://leetcode-cn.com/problems/partition-list/)
582-
- [] [sort-list](https://leetcode-cn.com/problems/sort-list/)
576+
- [X] [remove-duplicates-from-sorted-list](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)
577+
- [X] [remove-duplicates-from-sorted-list-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/)
578+
- [X] [reverse-linked-list](https://leetcode-cn.com/problems/reverse-linked-list/)
579+
- [X] [reverse-linked-list-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/)
580+
- [X] [merge-two-sorted-lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/)
581+
- [X] [partition-list](https://leetcode-cn.com/problems/partition-list/)
582+
- [X] [sort-list](https://leetcode-cn.com/problems/sort-list/)
583583
- [ ] [reorder-list](https://leetcode-cn.com/problems/reorder-list/)
584584
- [ ] [linked-list-cycle](https://leetcode-cn.com/problems/linked-list-cycle/)
585585
- [ ] [linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/)

‎introduction/quickstart.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -112,5 +112,5 @@ func backtrack(nums []int, pos int, list []int, result *[][]int) {
112112

113113
## 练习
114114

115-
- [] [strStr](https://leetcode-cn.com/problems/implement-strstr/)
116-
- [] [subsets](https://leetcode-cn.com/problems/subsets/)
115+
- [X] [strStr](https://leetcode-cn.com/problems/implement-strstr/)
116+
- [X] [subsets](https://leetcode-cn.com/problems/subsets/)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /