#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include
using namespace std;
int searchInsert(int* nums, int target,int n)
{
int len = n;
for (int i = 0; i < len; i++) {
if (nums[i] == target) {
return i;
}
}
if (nums[len - 1] < target) {
return len;
}
for (int j = 1; j < len; j++) {
if (target > nums[j - 1] && target < nums[j])
return j;
}
return 0;
}
int main()
{
int res = 0;
int arr[4] = {0};
int n = sizeof(arr)/sizeof(arr[0]);
for (int i = 0; i<n; ++i)
{
cin >> arr[i];
}
int tar;
cin >> tar;
res = searchInsert(arr, tar,n);
printf("%d", res);
}
2021-10-18
最新推荐文章于 2022-01-27 13:12:47 发布