LeetCode Search Insert Position

 1 public class Solution {
 2     public int searchInsert(int[] nums, int target) {
 3         if(nums == null || nums.length == 0){
 4             return -1;
 5         }
 6         int l = 0;
 7         int r = nums.length - 1;
 8         while(l<=r){
 9             int mid = l+(r-l)/2;
10             if(nums[mid] == target){
11                 return mid;
12             }else if(nums[mid] < target){
13                 l = mid+1;
14             }else{
15                 r = mid-1;
16             }
17         }
18         return l;
19     }
20 }