leetcode
文章平均质量分 84
chenwenwen1989
这个作者很懒,什么都没留下…
展开
-
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 · 305 阅读 · 0 评论 -
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 · 332 阅读 · 0 评论 -
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 · 261 阅读 · 0 评论 -
334. Increasing Triplet Subsequence
Task: Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k such that原创 2016-02-28 17:01:37 · 451 阅读 · 2 评论 -
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 · 252 阅读 · 0 评论