剑指offer：和为S的两个数字

题目描述

class Solution {
public:
vector<int> FindNumbersWithSum(vector<int> array, int sum) {
vector<int> v;
int size = array.size();
int start = 0;
int end = size-1;
while (start < end)
{
if (array[start] + array[end] > sum)
--end;
else if (array[start] + array[end] < sum)
++start;
else
{
v.push_back(array[start]);
v.push_back(array[end]);
break;
}
}
return v;
}
};