题目描述：
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:
Return true if there exists i, j, k
such that arr[i ...
标签归档：leetcode
[LeetCode]Increasing Triplet Subsequence
[LeetCode]Reconstruct Itinerary
作者是
发布于
在
LeetCode.
题目描述：
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 tickets belong to a man who departs from JFK. Thus, the ...
[LeetCode]Verify Preorder Serialization of a Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 331. Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-oder traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we ...
[LeetCode]Patching Array
作者是
发布于
在
LeetCode.
题目描述：
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 formed by the sum of some elements ...
[LeetCode]String to Integer (atoi)
作者是
发布于
在
LeetCode.
题目描述：
Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
Notes: It is intended ...