Search insert position, 查找插入位置

 1 public int searchInsert(int[] nums, int target)
 2     {
 3        return binarySearch(nums, 0, nums.length - 1, target); 
 4     }
 5     public int binarySearch(int[] nums, int left, int right, int target)
 6     {
 7         int mid = (left + right)/2;
 8         if(left > right)
 9         {
10             return left;
11         }
12         if(nums[mid] == target)
13         {
14             return mid;
15         }
16         else if(nums[mid] < target)
17         {
18             return binarySearch(nums, mid + 1, right, target);
19         }
20         else
21         {
22             return binarySearch(nums, left, mid - 1, target);
23         }
24     }