@@ -0,0 +1,474 @@
+public class Solution %7B%0A%0A    public static int searchInsert(int%5B%5D nums, int target) %7B%0A%0A        int low = 0;%0A        int high = nums.length;%0A%0A        while (low %3C high) %7B%0A%0A            int mid = low + (high - low) / 2;%0A%0A            if (nums%5Bmid%5D == target) %7B%0A                return mid;%0A            %7D%0A%0A            if (nums%5Bmid%5D %3C target) %7B%0A                low = mid + 1;%0A            %7D else %7B%0A                high = mid;%0A            %7D%0A%0A        %7D%0A%0A        return low;%0A%0A    %7D%0A%0A%7D%0A

Create : 35 Search Insert Position