博客

int searchInsert(int* nums, int numsSize, int target)
{
    int i = 0, count = 0, index = 0;
    int counts = 0;
    
    for(i = 0; i < numsSize; i++)
    {
        if(nums[i] == target)/*判断数组中有无和target一致的数字*/
        {
            count++;
            break;
        }
    }

    if(count != 1)/*数组中没有和target一样的数字*/
    {
        for(i = 0; i < numsSize; i++)/*区分应该插入数组中还是数组的最后*/
        {
            if(nums[i] > target)/*说明应该插入数组中*/
            {
                index = i;
                break;
            }
            else
            {
                counts++;
            }

            if(counts == numsSize)/*target大于数组中的左右数*/
            {
                index = i + 1;/*target插入到数组的最后*/
                return index;
            }
        }
    }
    else if(count == 1)/*如果数组中有和target一致的数字，则返回下标*/
    {
        index = i;
    }

    return index;
}