siriusli - 博客园

2019年2月16日

[Lintcode]18. Subsets II/[Leetcode]90. Subsets II

摘要： "18. Subsets II" / "90. Subsets II" 本题难度: Medium Topic: Search & Recursion Description Given a collection of integers that might contain duplicates, n 阅读全文

posted @ 2019-02-16 00:18 siriusli 阅读(133) 评论(0) 推荐(0)

2019年2月15日

[Lintcode]33. N-Queens/[Leetcode]51. N-Queens

摘要： "33. N Queens" / "51. N Queens" 本题难度: Medium/Hard Topic: Search & Recursion Description The n queens puzzle is the problem of placing n queens on an n 阅读全文

posted @ 2019-02-15 22:09 siriusli 阅读(146) 评论(0) 推荐(0)

[Lintcode]127. Topological Sorting

摘要： "127. Topological Sorting" 本题难度: Medium Topic: Search & Recursion Description Given an directed graph, a topological order of the graph nodes is defin 阅读全文

posted @ 2019-02-15 03:06 siriusli 阅读(187) 评论(0) 推荐(0)

[Lintcode]135. Combination Sum/[Leetcode]39. Combination Sum

摘要： "135. Combination Sum" / "39. Combination Sum" 本题难度: Medium Topic: Search & Recursion Description Given a set of candidate numbers (C) and a target nu 阅读全文

posted @ 2019-02-15 02:19 siriusli 阅读(108) 评论(0) 推荐(0)

[Lintcode]152. Combinations/[Leetcode]77. Combinations

摘要： "152. Combinations" / "77. Combinations" 本题难度: Medium Topic: Search & Recursion Description Given two integers n and k, return all possible combinatio 阅读全文

posted @ 2019-02-15 00:51 siriusli 阅读(136) 评论(0) 推荐(0)

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 阅读(129) 评论(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 阅读(176) 评论(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 阅读(133) 评论(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 阅读(88) 评论(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 阅读(109) 评论(0) 推荐(0)

公告