I've encountered a question online: find any increase sub-sequence with size 3 in an un-ordered array using O(n) time complexity. (just need to return one valid result)I've encountered a question online: find any in
阅读背景：
在无序数组中找到大小为3的任何增加子序列
来源：互联网
分享到：
