334. Increasing Triplet Subsequence（也可以使用dp动态规划）
摘要：
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 阅读全文
posted @ 2020-11-05 22:30 wsw_seu 阅读(83) 评论(0) 推荐(0) 编辑
