题解 | #二分查找-I#
二分查找-I
http://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
自己第一遍写的
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param nums int整型一维数组
* @param target int整型
* @return int整型
*/
public int search (int[] nums, int target) {
// write code here
return search(nums,0,nums.length-1,target);
}
public int search(int[] nums, int left, int right,int target){
if(left > right){
return -1;
}
int mid = left + (right - left)/2;
if(nums[mid] == target){
return mid;
}else if (target < nums[mid]){
return search(nums,left,mid-1,target);
}else{
return search(nums,mid+1,right,target);
}
}
}