@@ -0,0 +1,690 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/search-insert-position/%0A */%0Apublic class Problem35 %7B%0A    public int searchInsert(int%5B%5D nums, int target) %7B%0A        return searchInsert(nums, target, 0, nums.length-1);%0A    %7D%0A    %0A    private int searchInsert(int%5B%5D nums, int target, int left, int right) %7B%0A        if (left %3E right) %7B%0A            return left;%0A        %7D%0A        int mid = (left + right) / 2;%0A        if (target == nums%5Bmid%5D) %7B%0A            return mid;%0A        %7D else if (target %3C nums%5Bmid%5D) %7B%0A            return searchInsert(nums, target, left, mid-1);%0A        %7D else %7B // target %3E nums%5Bmid%5D%0A            return searchInsert(nums, target, mid+1, right);%0A        %7D%0A    %7D%0A%7D%0A

Solve problem 35