void findPair(int A[], int n, int sum)
{
int beg = 0;
int end = n - 1;
while (beg < end)
{
if (A[beg] + A[end] == sum)
{
printf("%2d + %2d = %2d\n", A[beg], A[end], sum);
++beg;
--end;
}
else if (A[beg] + A[end] < sum)
++beg;
else
--end;
}
}
findPair
最新推荐文章于 2023-04-30 14:08:27 发布