35 Search Insert Position

public class Solution {
     public int searchInsert(int[] nums, int target) {
	        if(target<nums[0]) return 0;
		 	int len = nums.length;
	        if(target>nums[len-1]) return len;
		 	int x = 0, y = len - 1;
		 	int r = 0;
		 	int middle = -1;
		 	while(x<=y){
		 		r = x + (y - x)/2;
		 		if(nums[r]==target){
		 			middle = r;
		 			break;
		 		}
		 		if(nums[r]>target){
		 			y = r - 1;
		 		}else{
		 			x = r + 1;
		 		}
		 	}
		 	if(middle!=-1) return middle;
		 	return x;
	 }
}