- 博客(4)
- 收藏
- 关注
原创 41. First Missing Positive
Task: Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and
2016-03-21 10:51:09 257
原创 19. Remove Nth Node From End of List
Task: Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from
2016-03-14 16:01:46 250
原创 331. Verify Preorder Serialization of a Binary Tree
Task: One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as
2016-03-07 20:11:35 330
原创 66. Plus One
Task: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. Some Questi
2016-03-01 16:09:57 300
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人