【leetcode】35搜索插入位置（自己理解的三种解法）

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

你可以假设数组中无重复元素。

示例 1:

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

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

输入: [1,3,5,6], 7
输出: 4
示例 4:

输入: [1,3,5,6], 0
输出: 0

利用二分查找来做，顺便贴出自己的二分查找代码

package bite04;

/**
 * ⊙﹏⊙&&&&&&⊙▽⊙
 *举例：区间长度[2,2] = 1，[2,2) = 0
 * 带等于号：left+1 = right（结束条件）
 * 不带等于号    left = right（结束条件）
 * @Auther: pangchenbo
 * @Date: 2020/1/7 09:52
 * @Description:二分查找
 */
public class binaryTest {
    /**
     * [left,right)搜索一次之后的区间为[left,mid)和[mid+1,right)
     * @param arr
     * @param value
     * @return
     */
    public static int binarySerach(int[] arr,int value){
        //[left,right)
        int left = 0;
        int right = arr.length;
        while (left<right){//表示现在的左闭右开区间还有数
            int mid = (left+right)/2;
            if(arr[mid] == value)
                return mid;
            if(arr[mid]<value)
                left = mid+1;
            else
                right = mid;
        }
        return -1;
    }
    /**
     *搜索一次区间[left,mid-1]   [mid+1,right]
     * @param arr
     * @param value
     * @return
     */
    public static int binarySerach2(int[] arr,int value){
        //[left,right]
        int left = 0;
        int right = arr.length-1;//控制区间形式
        while (left<=right){//表示现在的左闭右闭区间还有数
            int mid = (left+right)/2;//int mid = left + (right - left) / 2;
            System.out.println("mid: "+mid);
            if(arr[mid] == value)
                return mid;
            if(arr[mid]<value) {
                left = mid + 1;
                System.out.println("left: "+left);
            }
            else {
                right = mid - 1;
                System.out.println("right: "+right);
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        int [] array = {1,3,5,6};
        binarySerach2(array,2);
    }
}

本题代码

解法一：因为代码的结束条件是left == right，所以返回right和left都可以

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

解法二：本题的结束条件是left+1 = right，在跑到[left,right]的时候还有数，然后进行left+1操作，所以最后返回right+1.

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

解法三：解法二的基础上正常返回left

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