LeetCode 33 搜索旋转排序数组

Posted 2021-12-17 Starzkg

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/

解决方案

class Solution 
    public int search(int[] nums, int target) 
        int n = nums.length;
        if (n == 0) 
            return -1;
        
        if (n == 1) 
            return nums[0] == target ? 0 : -1;
        
        int l = 0, r = n - 1;
        while (l <= r) 
            int mid = (l + r) / 2;
            if (nums[mid] == target) 
                return mid;
            
            if (nums[0] <= nums[mid]) 
                if (nums[0] <= target && target < nums[mid]) 
                    r = mid - 1;
                 else 
                    l = mid + 1;
                
             else 
                if (nums[mid] < target && target <= nums[n - 1]) 
                    l = mid + 1;
                 else 
                    r = mid - 1;
                
            
        
        return -1;