35. 搜索插入位置 Java版

class Solution {
    public int searchInsert(int[] nums, int target) {

        int n=nums.length;

        int low=0;
        int high=n-1;

        while(low<=high){
            int mid=low+(high-low)/2;

            if(nums[mid]>target){

                high=mid-1;

            }else if(nums[mid]