leetcode 旋转排序数组

最新推荐文章于 2023-10-14 23:50:04 发布

crazytom1988

最新推荐文章于 2023-10-14 23:50:04 发布

阅读量78

点赞数

分类专栏： leetcode 面试算法

本文链接：https://blog.csdn.net/crazytom1988/article/details/102407209

版权

leetcode 同时被 2 个专栏收录

49 篇文章 0 订阅

订阅专栏

面试算法

9 篇文章 0 订阅

订阅专栏

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

查找特定数字，无重复数字

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0;
        int right = (int)nums.size()-1;
        while (left<=right)
        {
            int mid = left+((right-left)>>1);
            if (nums[mid] == target) return mid;
            
            if (nums[left]<=nums[mid])
            {
                if (nums[left]<=target && target < nums[mid])
                {        
                    right = mid-1;
                }
                else
                {
                    left = mid+1;
                }
            }            
            else
            {
                if (nums[mid]<target && target <= nums[right])
                {  
                    left = mid+1;                    
                }
                else
                {
                    right = mid-1;
                }                
            }
        }
        
        return -1;
    }
};

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

查找特定数字，有重复数字

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        int left = 0;
        int right = (int)nums.size()-1;
        while (left<=right)
        {
            int mid = left+((right-left)>>1);
            if (nums[mid] == target) return true;
            
            if (nums[left]<nums[mid])
            {
                if (nums[left]<=target && target < nums[mid])
                {        
                    right = mid-1;
                }
                else
                {
                    left = mid+1;
                }
            }            
            else if (nums[left] == nums[mid])
            {
                ++left;
            }
            else
            {
                if (nums[mid]<target && target <= nums[right])
                {  
                    left = mid+1;                    
                }
                else
                {
                    right = mid-1;
                }                
            }
        }
        
        return false;        
    }
};

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

查找最小值，无重复

class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0;
        int right = (int)nums.size()-1;
        while(left < right)
        {
            int mid = ((right-left)>>1) + left;
            if (nums[mid] > nums[right])
            {
                left = mid+1;
            }
            else
            {
                right = mid;
            }
        }
        return nums[left];
    }
};

https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/

查找最小值，有重复

class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0;
        int right = (int)nums.size()-1;
        while(left < right)
        {
            int mid = ((right-left)>>1) + left;
            if (nums[mid] > nums[right])
            {
                left = mid+1;
            }
            else if (nums[mid] < nums[right])
            {
                right = mid;
            }
            else
            {
                --right;
            }
        }
        return nums[left];
    }
};