每日一題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類的問題，這裏只是讓返回是否存在兩者之和

>>阅读原文<<