35.Search Insert Position

题目链接：search-insert-position

有待继续优化

/**
 * 
 * 
	Given a sorted array and a target value, return the index if the target is found. 
	If not, return the index where it would be if it were inserted in order.
	
	You may assume no duplicates in the array.
	
	Here are few examples.
	[1,3,5,6], 5 → 2
	[1,3,5,6], 2 → 1
	[1,3,5,6], 7 → 4
	[1,3,5,6], 0 → 0
	
 *
 */
public class SearchInsertPosition {

//	62 / 62 test cases passed.
//	Status: Accepted
//	Runtime: 210 ms
//	Submitted: 0 minutes ago

	
	//二分法查找
    static int searchInsert(int[] A, int target) {

    	return searchInsert(A, target, 0, A.length - 1);
    	
    }
    static int searchInsert(int[] A, int target, int left, int right) {    	 
    	
    	if(A[left] == target) return left;
    	
    	
    	if(left == right) {
    		if(A[left] > target) return (left == 0) ? 0 : left;
    		else if(A[left] < target) return left + 1;
    	}
    	
    	int mid = (right + left) / 2;
    	
    	if(A[mid] > target) right = mid;
    	
        else if(A[mid] < target) left = mid + 1;
    	
        else return mid;
    	
    	return searchInsert(A, target, left, right);
    	
    }
	public static void main(String[] args) {
		int[] A = new int[]{1, 3, 5, 6};
		System.out.println(searchInsert(A, 5));
		System.out.println(searchInsert(A, 2));
		System.out.println(searchInsert(A, 7));
		System.out.println(searchInsert(A, 0));
		System.out.println();
		int[] B = new int[]{1, 3};
		System.out.println(searchInsert(B, 2));
	}

}