Jan 16 - Search Insert Position; Array; Binary Search; Iteration&Recursion;－－－Iteration再补上

public class Solution {
    public int searchInsert(int[] nums, int target) {
        int len = nums.length;
        if(len == 0) return 0;
        return findPosition(nums, 0, len-1, target);
    }
    
    public int findPosition(int[] nums, int start, int end, int target){
        if(target > nums[end]) return end+1;
        if(target < nums[start]) return start;
        int mid = (start + end)/2;
        int num_mid = nums[mid];
        if(target == num_mid) return mid;
        if(target > num_mid) return findPosition(nums, mid+1, end, target);
        else return findPosition(nums, start, mid-1, target);
    }
}