@@ -0,0 +1,535 @@
+public class Solution %7B%0A    public int searchInsert(int%5B%5D nums, int target) %7B%0A        if(nums == null %7C%7C nums.length %3C 1 %7C%7C target %3C nums%5B0%5D) return 0;%0A        if(target %3E nums%5Bnums.length - 1%5D)  return nums.length;%0A        %0A        int left = 0, right = nums.length;%0A        while(left %3C right) %7B%0A            int mid = left + (right - left) / 2;%0A            if      (nums%5Bmid%5D %3C target)    left = mid + 1;%0A            else if (nums%5Bmid%5D %3E target)    right = mid;%0A            else    return mid;%0A        %7D%0A        return left;%0A    %7D%0A%7D%0A

Create 035.java