find length of longest consecutive subsequence S in an unsorted array where min * 2 > max.
摘要:这种题 普遍思路是 两个指针 一个头一个尾. Min max len
阅读全文
posted @ 2014-12-12 08:21
posted @ 2014-12-12 08:21
posted @ 2013-08-16 07:05