LeetCode 搜索插入位置

Posted 2021-09-10 xhBruce

35. 搜索插入位置

需要时间复杂度为 O(log n) ，可以利用二分法 LeetCode 二分法查找

class Solution {
    public int searchInsert(int[] nums, int target) {
        int right = nums.length - 1;
        int left = 0;

        while (right >= left) {
            int result = (right - left) / 2 + left;
            System.out.println(result);
            if (target == nums[result]) {
                return result;
            } else if (target > nums[result]) {
                left = result + 1;
            } else {
                right = result - 1;
            }
        }
        
        return right>left?left+1:right+1;
    }
}