剑指offer 和为S的两个数字

class

Solution {

public

:

vector<

int

> FindNumbersWithSum(vector<

int

> array,

int

sum) {

int

i =

0

;

int

j = array.size()-

1

;

vector<

int

> result;

while

(i < j)

{

if

(array[i] + array[j] == sum)

{

result.push_back(array[i]);

result.push_back(array[j]);

return

result;

}

else

if

(array[i] + array[j] > sum)

j--;

else

i++;

}

return

result;

}

};