【leetcode算法-搜索插入位置】

//暴力破解法
    static int searchInsert(int[] nums, int target){
        for (int i=0;i<nums.length;i++){
            int vi = nums[i];
            if (i<nums.length-1){
                int n = i+1;
                int vi1 = nums[n];
                if (vi > target){
                    System.out.println(0);
                    return 0;
                }
                if (vi == target){
                    System.out.println(i);
                    return i;
                }
                if (vi<target && target<vi1){
                    System.out.println(n);
                    return n;
                }
            }else {
                if (vi<target)
                {
                    System.out.println(nums.length);
                    return nums.length;
                }else {
                    System.out.println(nums.length-1);
                    return nums.length-1;
                }

            }
        }
        return  0;
    }

//二分查找
    static int searchInsert2(int[] nums, int target){
        int left = 0, right = nums.length - 1; 
        int rs = 0;
        while(left <= right) { 
            int mid = (left + right) / 2; 
            if(nums[mid] == target) { 
                // 相关逻辑
                return mid;
            } else if(nums[mid] < target) {
                left = mid + 1; 
                rs = left;
            } else {
                right = mid - 1; 
                if (right < 0){
                   return  0;
                }
                rs = mid;
            }
        }
        // 相关返回值
        return rs;
    }