@@ -0,0 +1,793 @@
+public class Solution %7B%0A    public int searchInsert(int%5B%5D nums, int target) %7B%0A        if(nums.length == 0 %7C%7C target %3C nums%5B0%5D)%7B%0A            return 0;%0A        %7Delse if( target %3E nums%5Bnums.length - 1%5D)%7B%0A            return nums.length;%0A        %7Delse%7B%0A            return find(nums, 0, nums.length-1, target);%0A        %7D%0A    %7D%0A    %0A    public int find(int%5B%5D nums, int m, int n, int target)%7B%0A        if(m == (n-1))%7B%0A            if(nums%5Bm%5D %3E= target)%7B%0A                return m;%0A            %7Delse%7B%0A                return n;%0A            %7D%0A        %7D%0A        if(nums%5Bm + (n-m)/2%5D %3E target)%7B%0A            return find(nums, m, m+(n-m)/2, target);%0A        %7Delse if(nums%5Bm + (n-m)/2%5D %3C target)%7B%0A            return find(nums, m+(n-m)/2, n, target);%0A        %7Delse%7B%0A            return m+(n-m)/2;%0A        %7D%0A    %7D%0A%7D

Q35 Search Insert Position