35.搜索插入位置

智科2周浩

于 2022-12-22 13:51:17 发布

阅读量37

点赞数

分类专栏： leetcode 文章标签：算法数据结构 c++

本文链接：https://blog.csdn.net/qq_53311764/article/details/128407727

版权

leetcode 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

int searchInsert(int* nums, int numsSize, int target){
    if(nums[0] >= target) return 0;
    if(nums[numsSize-1] < target) return numsSize;
    if(nums[numsSize-1] == target) return numsSize-1; 
    int i = 0, j = numsSize, binary = 0;
    while(j - i > 1){
        binary = floor((i + j) / 2) ;
        if(nums[binary] == target) return binary;
        else if(nums[binary] < target) i = binary; 
        else j = binary;
    }
    return i+1;
    
}