
1条回答 默认 最新
技术专家团-Plio大咸鱼 2021-09-09 13:51关注修改如下,有帮助望采纳
#include <iostream> using namespace std; int search(int* A, int n, int k) { int i = 0; while (i <= n - 1) if (A[i] != k) i++; else break; if (i <= n - 1) return 1; else return -1; } int main() { int n = 5; int A[n] = {1, 2, 3, 4, 5}; int k = 7; int Search = search(A, n, k); cout << Search; }本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报