LeetCode 33: Search in Rotated Sorted Array

最新推荐文章于 2024-10-23 14:58:41 发布

forever_zzx

最新推荐文章于 2024-10-23 14:58:41 发布

阅读量108

点赞数

分类专栏：算法 python 文章标签： LeetCode

本文链接：https://blog.csdn.net/forever_zzx/article/details/87216037

版权

算法同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

python

46 篇文章 0 订阅

订阅专栏

This problem is little difference to LeetCode 81. Search in Rotated Sorted Array II. In this problem, it assumes that no duplicate exists in the array.
Binary search is used to solve it. Iteration and recursion methods are implemented below.

1 Iteration

class Solution:
    def search(self, nums: 'List[int]', target: 'int') -> 'int':
        l, r = 0, len(nums) - 1
        while l <= r:
            
            mid = (l + r) // 2
            if nums[mid] == target:
                return mid
            if nums[mid] < nums[r]:
                if target >= nums[mid] and target <= nums[r]:
                    l = mid + 1
                else:
                    r = mid - 1
            else:
                if target >= nums[l] and target <= nums[mid]:
                    r = mid-1
                else:
                    l = mid + 1
        return -1

2 Recursion

class Solution:
    def search(self, nums: 'List[int]', target: 'int') -> 'int':
        def recursion(nums, l, r):
            if l <= r:
                mid = (l + r)//2
                if nums[mid] == target:
                    return mid
                if nums[mid] < nums[r]:
                    if target >= nums[mid] and target <= nums[r]:
                        l = mid + 1
                    else:
                        r = mid - 1
                else:
                    if target >= nums[l] and target <= nums[mid]:
                        r = mid - 1
                    else:
                        l = mid + 1
                return recursion(nums, l, r)
            else:
                return -1
        return recursion(nums, 0, len(nums) - 1)