版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ShellDawn/article/details/88926072
返回空数组:
return *(new vector<int>);
class Solution {
public:
bool bsearch(vector<int> v,int l,int r,int target,int &key){
if(l>=r-1)
if(target == v[l]){
key = v[l];
return true;
}else{
return false;
}
int mid = (l+r+1)/2;
if(v[mid] > target) return bsearch(v,l,mid,target,key);
else return bsearch(v,mid,r,target,key);
}
vector<int> FindNumbersWithSum(vector<int> array,int sum) {
int l = array.size();
vector<int> ans;
ans.resize(2);
int mult = 200000000;
int flag = false;
for(int i=0;i<l;i++){
int k ;
if(bsearch(array,0,l,sum-array[i],k)){
if(k*array[i] < mult){
flag = true;
ans[0] = min(k,array[i]);
ans[1] = max(k,array[i]);
}
}
}
if(flag) return ans;
else return *(new vector<int>);
}
};