每日一题6.24

Describe a O(nlgn)-time algorithm that,given a set S of n integers and another integer x,determines whether or not there exist two elements in S whose sum is exactly x.数组 相似于TwoSum类的问题，这里只是让返回是否存在两者之和

>>阅读原文<<