@@ -0,0 +1,1103 @@
+package leetcode.search_insert_position;%0A%0Apublic class Solution %7B%0A    public int searchInsert(int%5B%5D A, int target) %7B%0A    %09if(A == null) return 0;%0A    %09if(A.length == 0) return 0;%0A    %09int U = A.length;%0A    %09int L = 0;%0A    %09if(target %3C= A%5B0%5D) return 0;%0A    %09while(L + 1 %3C U)%7B%0A    %09%09int mid = (L + U) / 2;%0A    %09%09if(A%5Bmid%5D == target) return mid;%0A    %09%09if(A%5Bmid%5D %3E target)%7B%0A    %09%09%09U = mid;%0A    %09%09%7Delse%7B%0A    %09%09%09L = mid;%0A    %09%09%7D%0A    %09%7D%0A    %09return U;%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 0));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 1));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 2));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 3));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 4));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 5));%0A    %09System.err.println(%22%22 + new Solution().searchInsert(new int%5B%5D%7B1, 2, 3, 5%7D, 6));%0A    %7D%0A%7D%0A

Add java solution for 35. Search Insert Position