LeetCode 35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

public class Solution {    public int searchInsert(int[] nums, int target) {       if(nums.length==0){            return 0;        }        int left=0;        int right=nums.length-1;        int median=0 ;        while(left<=right){  //二分查找法        median = (left+right)/2;            if(nums[median]==target){                break;            }else if(nums[median]<target)            {                left=median+1;            }else{                right=median-1;            }        }                if(left>right){   //数组中不存在target        if(target>nums[median]){            return median+1;        }else           return median;        }         return median;    //数组中存在target            }}