题目:输入一个已知按升序排列过的数组和一个数字,要求在数组查找两个数,使得它们的和正好是输入的那个数字,并且时间复杂度是O(n)
个人代码:
#include<iostream>
using namespace std;
int main()
{
int find,length,beg=0;
cout<<"input the length of the array:"<<endl;
cin>>length;
int *a=new int[100];
for(int i=0;i!=length;++i)
{
cout<<"输入数字:"<<endl;
cin>>a[i];
}
cout<<"input the desired number:"<<endl;
cin>>find;
while(beg<length-1)
{
if((a[beg]+a[length-1])>find)
--length;
else if((a[beg]+a[length-1])<find)
++beg;
else
{
cout<<"这两个数是:"<<a[beg]<<" "<<a[length-1]<<endl;
break;
}
}
if(beg==length-1)
{
cout<<"not found!!!"<<endl;
}
return 0;
}