经典的前后指针向中逼近的题目。
class Solution {
public:
vector<int> FindNumbersWithSum(vector<int> array,int sum) {
vector<int> re;
int left = 0;
int right = array.size() - 1;
while(left < right)
{
if(array[left] + array[right] == sum)
{
re.push_back(array[left]);
re.push_back(array[right]);
break;
}
if(array[left] + array[right] > sum)
right--;
if(array[left] + array[right] < sum)
left++;
}
return re;
}
};