- 博客(20)
- 收藏
- 关注
原创 8.3 证明STINGY SAT是NP完全问题
题目STINGY SAT is the following problem: given a set of clauses(each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are true, if such an assignment
2017-07-04 17:13:35 939
原创 LeetCode 230. Kth Smallest Element in a BST
the kth smallest element in binary search tree
2017-06-28 16:10:34 255
原创 LeetCode 515. Find Largest Value in Each Tree Row
largest value in each row of a binary tree
2017-06-28 10:47:51 390
原创 LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
construct the binary tree
2017-06-27 14:26:31 332
原创 LeetCode 21.Merge Two Sorted Lists
LeetCode(1.1) 21. Merge Two Sorted Lists
2017-02-25 23:21:18 249
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人