0004【数组】简单LeetCode35.搜索插入位置

妙语空空

已于 2023-02-02 10:30:04 修改

阅读量63

点赞数

分类专栏： 152.0LeetCode 文章标签：算法数据结构 java leetcode

于 2023-02-01 08:59:16 首次发布

本文链接：https://blog.csdn.net/MUYUHF/article/details/128826394

版权

152.0LeetCode 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        int mid = 0;
        while (left <= right) {
            mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            }
        }
        if (nums[mid] > target) {
            return mid;
        } else {
            return mid + 1;
        }
    }
}

方法二：二分查找

解题思路
使用左闭右闭区间的二分查找，目标值不在数组内时返回最后一次的right+1

class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            }
        }
        return right + 1;
    }
}