思路:
运用双引用遍历,一个数从左往右遍历,一个数从右向左遍历
若是sum和大于要找的数,右边的数向左移动;
若是sum和小于要找的数,左边的数向右移动;
最终相等时,返回左右下标
//求一个有序数组中,两个值相加为key的数字,返回这两个数字的下标
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int x;
int y;
void Find(int *a, int n, int key)
{
int left = 0;
int right = n - 1;
int sum = 0;
while (left <= right)
{
sum = a[left] + a[right];
if (sum < key)
{
left++;
}
else if (sum>key)
{
right--;
}
else
{
x = left;
y = right;
break;
}
}
}
int main()
{
int a[8] = { 1, 2, 3, 4, 5, 7, 7, 8 };
int n = sizeof(a) / sizeof(a[0]);
int key;
printf("请输入一个数:");
scanf("%d", &key);
Find(a, n, key);
printf("%d %d", x, y);
system("pause");
return 0;
}