package com.app.main.LeetCode;
/**
* 33
*
* medium
*
* https://leetcode.com/problems/search-in-rotated-sorted-array/
*
* Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
*
* (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
*
* You are given a target value to search. If found in the array return its index, otherwise return -1.
*
* You may assume no duplicate exists in the array.
*
* Your algorithm's runtime complexity must be in the order of O(log n).
*
* Example 1:
*
* Input: nums = [4,5,6,7,0,1,2], target = 0
* Output: 4
* Example 2:
*
* Input: nums = [4,5,6,7,0,1,2], target = 3
* Output: -1
* Created with IDEA
* author:Dingsheng Huang
* Date:2019/9/26
* Time:下午5:18
*/
public class SearchInRotatedSortedArray {
public int search(int[] nums, int target) {
int l = 0;
int r = nums.length - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (nums[mid] == target) {
return mid;
}
// 左侧有序, 判断目标值是否在左侧内
if (nums[l] <= nums[mid]) {
if (nums[mid] > target && nums[l] <= target) {
r = mid - 1;
} else {
l = mid + 1;
}
}
// 右侧有序,判断目标值是否在右侧内
if (nums[mid] <= nums[r]) {
if (nums[mid] < target && nums[r] >= target) {
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return -1;
}
}