**题目:输入一个递增排序的数组和一个数字s,在数组中查找两个数使得他们的和正好是s。如果有多对,输出任意一对即可。
代码示例:**
#includeusing namespace std; bool SumIsS(int a[], int n, int s,int &num1, int &num2) { if (a == NULL || n <= 1) return false; int i = 0; int j = n - 1; while (i < j) { if (a[i] + a[j] == s) { num1 = a[i]; num2 = a[j]; return true; } else if (a[i] + a[j] < s) { i++; } else { j--; } } return false; } int main() { const int n = 8; int a[n] = { 1, 3, 5, 7, 8, 9, 11, 13 }; int num1 = 0; int num2 = 0; int s = 24; bool flag = SumIsS(a, n, s, num1, num2); if (flag) { cout << "和为" << s << "的两个数:" << num1 << " " << num2 << endl; } else { cout << "和为" << s << "的两个数不存在!" << endl;; } }