//é¢è¯•é¢˜57：和为sçš„æ•°å—
//题目1：和为s的两个数å—
bool FindNumbersWithSum(int data[],int length,int sum,int* num1,int* num2)
{
bool found=false;
if(length<1 || num1==nullptr || num2==nullptr)
return found;
int ahead=length-1;
int behind=0;
while(ahead<=behind){
long long curSum=data[ahead]+data[behind];
if(curSum==sum){
*number1=data[ahead];
*number2=data[behind];
found=true;
break;
}else if(curSum