本文共 918 字,大约阅读时间需要 3 分钟。
力扣原题:
class Solution { public int search(int[] nums, int target) { int left = 0; int right = nums.length - 1; while (left <= right) { int mid = (left + right) / 2; if (target == nums[mid]) { return mid; } // 左边有序 if (nums[mid] >= nums[0]) { if (target < nums[mid] && target >= nums[0]) { right = mid - 1; } else { left = mid + 1; } } // 右边有序 else { if (target > nums[mid] && target <= nums[nums.length - 1]) { left = mid + 1; } else { right = mid - 1; } } } return -1; }}
转载地址:http://ejaii.baihongyu.com/