class Solution {
public:
vector<int> FindNumbersWithSum(vector<int> array,int sum) {
vector<int> res;
int len = array.size();
if(len <2) return res;
for(int i = 0, j = len - 1; i < j;)
{
if(array[i] + array[j] > sum) j--;
else if(array[i] + array[j] < sum) i++;
else{
res.push_back(array[i]);
res.push_back(array[j]);
break;
}
}
return res;
}
};
剑指offer:和为S的两个数字
最新推荐文章于 2020-04-03 11:23:26 发布