题目链接. - 力扣(LeetCode)
代码:
class Solution {
public int search(int[] nums, int target) {
Arrays.sort(nums);
int left = 0;
int right = nums.length - 1;
int mid=0;
while (left <= right) {
mid = (right + left)/2;
if (nums[mid] > target) {
right = mid - 1;
}
else if (nums[mid] < target) {
left = mid + 1;
}
else {
break;
}
}
if(nums[mid]!=target) {
return -1;
}
else
return mid;
}
}