/*
* @lc app=leetcode.cn id=33 lang=java
*
* [33] 搜索旋转排序数组
*/
// @lc code=start
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while(left <= right){
int mid = left + (right - left) / 2;
if(target == nums[mid]){
return mid;
}
else if(nums[mid] >= nums[left]){
if(target > nums[mid] || target < nums[left]){
left = mid + 1;
}
else{
right = mid - 1;
}
}
else{
if(target < nums[mid] || target > nums[right]){
right = mid - 1;
}
else{
left = mid + 1;
}
}
}
return -1;
}
}
// @lc code=end
