LeetCode刷題Medium篇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] <  arr
相關文章
相關標籤/搜索