2017年12月10日
Leetcode 334: Increasing Triplet Subsequence
摘要： Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm 阅读全文
posted @ 2017-12-10 13:55 逸朵 阅读(123) 评论(0) 推荐(0)
Leetcode 332: Reconstruct Itinerary
摘要： Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tick 阅读全文
posted @ 2017-12-10 12:30 逸朵 阅读(180) 评论(0) 推荐(0)
Leetcode 331: Verify Preorder Serialization of a Binary Tree
摘要： 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, 阅读全文
posted @ 2017-12-10 10:22 逸朵 阅读(104) 评论(0) 推荐(0)
Leetcode 330: Patching Array
摘要： Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n]inclusive can be form 阅读全文
posted @ 2017-12-10 02:55 逸朵 阅读(186) 评论(0) 推荐(0)