直接二分查找即可,时间复杂度O(logn),空间复杂度O(1)
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param nums int整型一维数组
* @param target int整型
* @return int整型
*/
public int search (int[] nums, int target) {
// write code here
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0, end = nums.length, mid = (end + start) / 2;
while (start <= end) {
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
start = mid + 1;
mid = (end + start) / 2;
} else {
end = mid - 1;
mid = (end + start) / 2;
}
}
return -1;
}
}