LeetCode 之 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] ar
原创
2016-04-12 11:23:09 ·
218 阅读 ·
0 评论