457. 经典二分查找问题

public static int findPosition(int[] nums, int target) {
// write your code here
Arrays.sort(nums);
if (nums == null || nums.length == 0) {
return -1;
}
int start = 0, end = nums.length - 1;
// 记住start + 1 < end;
while (start + 1 < end) {
int mid = (end - start) / 2 + start;
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
start = mid + 1;
} else {
end = mid - 1;
}
}
if (nums[start] == target) {
return start;
}

	if (nums[end] == target) {
		return end;
	}

	return -1;
}