2019年2月14日
[Lintcode]7. Serialize and Deserialize Binary Tree/[Leetcode]297. Serialize and Deserialize Binary Tree
摘要： "7. Serialize and Deserialize Binary Tree" / "297. Serialize and Deserialize Binary Tree" 本题难度: Medium/Hard Topic: Binary Tree Description Design an a 阅读全文
posted @ 2019-02-14 22:57 siriusli 阅读(123) 评论(0) 推荐(0) 编辑
[Lintcode]11. Search Range in Binary Search Tree
摘要： "11. Search Range in Binary Search Tree" 本题难度: Medium Topic: Binary Tree Description Given a binary search tree and a range [k1, k2], return all eleme 阅读全文
posted @ 2019-02-14 22:10 siriusli 阅读(167) 评论(0) 推荐(0) 编辑
[Leetcode]700. Search in a Binary Search Tree
摘要： "700. Search in a Binary Search Tree" 本题难度: Easy Topic: Binary Tree Description Given the root node of a binary search tree (BST) and a value. You nee 阅读全文
posted @ 2019-02-14 21:46 siriusli 阅读(126) 评论(0) 推荐(0) 编辑
[Lintcode]73. Construct Binary Tree from Preorder and Inorder Traversal/[Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal
摘要： "73. Construct Binary Tree from Preorder and Inorder Traversal" /[105. Construct Binary Tree from Preorder and Inorder Traversal ](https://leetcode.co 阅读全文
posted @ 2019-02-14 21:40 siriusli 阅读(83) 评论(0) 推荐(0) 编辑
[Lintcode]95. Validate Binary Search Tree/[Leetcode]98. Validate Binary Search Tree
摘要： "95. Validate Binary Search Tree" / "98. Validate Binary Search Tree" 本题难度: Easy Topic: Binary Tree Description Given a binary tree, determine if it i 阅读全文
posted @ 2019-02-14 21:31 siriusli 阅读(103) 评论(0) 推荐(0) 编辑
[Lintcode]66. Binary Tree Preorder Traversal/[Leetcode]144. Binary Tree Preorder Traversal
摘要： "66. Binary Tree Preorder Traversal" / "144. Binary Tree Preorder Traversal" 本题难度: Easy/Medium Topic: Binary Tree Description Given a binary tree, ret 阅读全文
posted @ 2019-02-14 20:38 siriusli 阅读(122) 评论(0) 推荐(0) 编辑
[Lintcode]69. Binary Tree Level Order Traversal/[Leetcode]102. Binary Tree Level Order Traversal
摘要： "69. Binary Tree Level Order Traversal" / "102. Binary Tree Level Order Traversal" 本题难度: Easy/Medium Topic: Binary Tree Description Given a binary tre 阅读全文
posted @ 2019-02-14 20:30 siriusli 阅读(75) 评论(0) 推荐(0) 编辑
[Lintcode]85. Insert Node in a Binary Search Tree/[Leetcode]701. Insert into a Binary Search Tree
摘要： "85. Insert Node in a Binary Search Tree" / "701. Insert into a Binary Search Tree" 本题难度: Easy/Medium Topic: Binary Tree Given a binary search tree an 阅读全文
posted @ 2019-02-14 20:11 siriusli 阅读(103) 评论(0) 推荐(0) 编辑
[Lintcode]93. Balanced Binary Tree/[Leetcode]110. Balanced Binary Tree
摘要： "93. Balanced Binary Tree" / "110. Balanced Binary Tree" 本题难度: Easy Topic: Binary Tree Description Given a binary tree, determine if it is height bala 阅读全文
posted @ 2019-02-14 19:48 siriusli 阅读(103) 评论(0) 推荐(0) 编辑
[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree
摘要： "97. Maximum Depth of Binary Tree" / "104. Maximum Depth of Binary Tree" 本题难度: Easy Topic: Binary Tree Description Given a binary tree, find its maxim 阅读全文
posted @ 2019-02-14 19:19 siriusli 阅读(95) 评论(0) 推荐(0) 编辑
[Lintcode]98. Sort List/[Leetcode]148. Sort List
摘要： "98. Sort List" / "148. Sort List" 本题难度: Medium Topic: Linked List Description Sort a linked list in O(n log n) time using constant space complexity. 阅读全文
posted @ 2019-02-14 18:58 siriusli 阅读(101) 评论(0) 推荐(0) 编辑
[Lintcode]99. Reorder List/[Leetcode]143. Reorder List
摘要： "99. Reorder List" /[143. Reorder List ](https://leetcode.com/problems/reorder list/) 本题难度: Medium Topic: Linked List Description Given a singly linke 阅读全文
posted @ 2019-02-14 18:27 siriusli 阅读(72) 评论(0) 推荐(0) 编辑
[Lintcode]102. Linked List Cycle/[Leetcode]141. Linked List Cycle
摘要： "102. Linked List Cycle" / "141. Linked List Cycle" 本题难度: Medium/Easy Topic: Linked List Description A linked list is given such that each node contai 阅读全文
posted @ 2019-02-14 17:05 siriusli 阅读(65) 评论(0) 推荐(0) 编辑
[Lintcode]102. Linked List Cycle/[Leetcode]
摘要： "106. Convert Sorted List to Binary Search Tree" / "109. Convert Sorted List to Binary Search Tree" 本题难度: Medium/Easy Topic: Linked List Description A 阅读全文
posted @ 2019-02-14 17:04 siriusli 阅读(59) 评论(0) 推荐(0) 编辑
[Lintcode]105. Copy List with Random Pointer/[Leetcode]138. Copy List with Random Pointer
摘要： "105. Copy List with Random Pointer" / "138. Copy List with Random Pointer" 本题难度: Medium Topic: Linked List A linked list is given such that each node 阅读全文
posted @ 2019-02-14 16:51 siriusli 阅读(118) 评论(0) 推荐(0) 编辑
[Lintcode]106. Convert Sorted List to Binary Search Tree/[Leetcode]109. Convert Sorted List to Binary Search Tree
摘要： "106. Convert Sorted List to Binary Search Tree" / "109. Convert Sorted List to Binary Search Tree" 本题难度: Medium/Medium Topic: Linked List Description 阅读全文
posted @ 2019-02-14 15:10 siriusli 阅读(75) 评论(0) 推荐(0) 编辑