int searchInsert(int* nums, int numsSize, int target) {
//首部判断
if(numsSize == 0 || nums[0] >= target) return 0;
//主体判断
int i = 0;
while(i < numsSize - 1){
if(nums[i] == target) return i;
else if(nums[i] < target && nums[i + 1] > target) return i + 1;
else ++i;
}
//尾部判断
if(nums[numsSize - 1] == target) return numsSize - 1;
else return numsSize;
}
//首部判断
if(numsSize == 0 || nums[0] >= target) return 0;
//主体判断
int i = 0;
while(i < numsSize - 1){
if(nums[i] == target) return i;
else if(nums[i] < target && nums[i + 1] > target) return i + 1;
else ++i;
}
//尾部判断
if(nums[numsSize - 1] == target) return numsSize - 1;
else return numsSize;
}