2016年2月17日
[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: Your algorithm 阅读全文
posted @ 2016-02-17 10:45 Grandyang 阅读(17937) 评论(3) 推荐(1)
Fork me on GitHub