From 6f9a63e02a110d35c605b011ae41c2d48c96780f Mon Sep 17 00:00:00 2001 From: johnnyumr Date: Sat, 1 Aug 2020 17:30:24 +0800 Subject: [PATCH] check finished --- data_structure/binary_tree.md | 18 +++++++++--------- data_structure/linked_list.md | 14 +++++++------- introduction/quickstart.md | 4 ++-- 3 files changed, 18 insertions(+), 18 deletions(-) diff --git a/data_structure/binary_tree.md b/data_structure/binary_tree.md index d01a8ca4..14f9abd2 100644 --- a/data_structure/binary_tree.md +++ b/data_structure/binary_tree.md @@ -773,12 +773,12 @@ func insertIntoBST(root *TreeNode, val int) *TreeNode { ## 练习 -- [ ] [maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/) -- [ ] [balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/) -- [ ] [binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/) -- [ ] [lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/) -- [ ] [binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/) -- [ ] [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/) -- [ ] [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/) -- [ ] [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/) -- [ ] [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/) +- [X] [maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/) +- [X] [balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/) +- [X] [binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/) +- [X] [lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/) +- [X] [binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/) +- [X] [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/) +- [X] [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/) +- [X] [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/) +- [X] [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/) diff --git a/data_structure/linked_list.md b/data_structure/linked_list.md index 14585e91..7466a279 100644 --- a/data_structure/linked_list.md +++ b/data_structure/linked_list.md @@ -573,13 +573,13 @@ func copyRandomList(head *Node) *Node { ## 练习 -- [ ] [remove-duplicates-from-sorted-list](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/) -- [ ] [remove-duplicates-from-sorted-list-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/) -- [ ] [reverse-linked-list](https://leetcode-cn.com/problems/reverse-linked-list/) -- [ ] [reverse-linked-list-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/) -- [ ] [merge-two-sorted-lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/) -- [ ] [partition-list](https://leetcode-cn.com/problems/partition-list/) -- [ ] [sort-list](https://leetcode-cn.com/problems/sort-list/) +- [X] [remove-duplicates-from-sorted-list](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/) +- [X] [remove-duplicates-from-sorted-list-ii](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/) +- [X] [reverse-linked-list](https://leetcode-cn.com/problems/reverse-linked-list/) +- [X] [reverse-linked-list-ii](https://leetcode-cn.com/problems/reverse-linked-list-ii/) +- [X] [merge-two-sorted-lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/) +- [X] [partition-list](https://leetcode-cn.com/problems/partition-list/) +- [X] [sort-list](https://leetcode-cn.com/problems/sort-list/) - [ ] [reorder-list](https://leetcode-cn.com/problems/reorder-list/) - [ ] [linked-list-cycle](https://leetcode-cn.com/problems/linked-list-cycle/) - [ ] [linked-list-cycle-ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/) diff --git a/introduction/quickstart.md b/introduction/quickstart.md index d2957394..b3c9d415 100644 --- a/introduction/quickstart.md +++ b/introduction/quickstart.md @@ -112,5 +112,5 @@ func backtrack(nums []int, pos int, list []int, result *[][]int) { ## 练习 -- [ ] [strStr](https://leetcode-cn.com/problems/implement-strstr/) -- [ ] [subsets](https://leetcode-cn.com/problems/subsets/) +- [X] [strStr](https://leetcode-cn.com/problems/implement-strstr/) +- [X] [subsets](https://leetcode-cn.com/problems/subsets/)

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