find length of longest consecutive subsequence S in an unsorted array where min * 2 > max.

这种题 普遍思路是 两个指针 一个头一个尾.  

Min max len