题目
思路
-
代码
public int search(int[] nums, int target) {int left = 0, rigth = nums.length - 1;while (left <= rigth) {int index = (left + rigth) / 2;if (nums[index] == target) return index;if (nums[index] > target) rigth = index - 1;else left = index + 1;}return -1;}public int search(int[] nums, int target) {int left = 0, rigth = nums.length;while (left < rigth) {int index = (left + rigth) / 2;if (nums[index] == target) return index;if (nums[index] > target) rigth = index;else left = index + 1;}return -1;}
