35. Search Insert Position

AC 2ms java

code :

class Solution {
    public int searchInsert(int[] nums, int target) {
        if(nums==null||nums.length==0)
            return -1;
        int i=0,j=nums.length;
        int pos=0;
        if(target<nums[0])
            return 0;
        if(target>nums[nums.length-1])
            return nums.length;
        while(i<=j&&j>=0&&i<nums.length){
            int mid=(i+j)/2;
            pos=mid;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]>target)
                j=mid-1;    
            else if(nums[mid]<target)
                i=mid+1;
        }
        return nums[pos]<target?pos+1:pos;
    }
}