力扣每日一題

给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

请必须使用时间复杂度为 O(log n) 的算法。

示例 1:

输入: nums = [1,3,5,6], target = 5
输出: 2
示例 2:

输入: nums = [1,3,5,6], target = 2
输出: 1
示例 3:

输入: nums = [1,3,5,6], target = 7
输出: 4
 

提示:

1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums 为 无重复元素 的 升序 排列数组
-104 <= target <= 104

力扣提交代码：

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

 

idea测试代码：

public class Erfen {
    public static void main(String[] args) {
        int[] nums = {1,3,5,6};
        int target = 8;
        int a=searchInsert(nums,target);
        System.out.println(a);
    }
    public static int searchInsert(int[] nums,int target){
        int left=0;
        int right = nums.length-1;
        int result=-1;
        while(left<=right){
            int mid = (left+ right)/2;
            if(target==nums[mid]){
                result=mid;
                break;
            }else if(target<nums[mid]){
                result = mid;
                right = mid -1;
            }else{
                result=mid+1;
                left=mid+1;
            }
        }
        return result;
    }
}