该博客讨论了LeetCode 81题，即在可能含有重复元素的旋转排序数组中搜索目标值。博主解释了由于数组可能存在的重复元素，使得常规的二分查找法需要调整判断条件，特别是在判断单调区间时，当遇到相等的中点和左侧元素，需要将左边界左移。博主提供了如何修改上一题（LeetCode 33）的代码以适应本题的解决方案。
There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).
Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot index 5 and become [4,5,6,6,7,0,1,2,4,4].
Given the array nums after the rotation and an integer target, return true if target is in nums, or false if it is not in nums.
You must decrease the overall operation steps as much as possible.
Example 1:
最低0.47元/天 解锁文章
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
