zoukankan      html  css  js  c++  java
  • 153. Find Minimum in Rotated Sorted Array (Array; Divide-and-Conquer)

    Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

    (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

    Find the minimum element.

    You may assume no duplicate exists in the array.

    class Solution {
    public:
        int findMin(vector<int>& nums) {
            return dfs(nums,0,nums.size()-1);
        }
        
        int dfs(vector<int>& nums, int start, int end){
            if(start==end) return nums[start];
            
            int mid = start + ((end - start) >> 1);
            if(nums[start] <= nums[mid] && nums[mid] < nums[end]){ //no rotate
                return nums[start];
            }
            else if(nums[start] <= nums[mid] && nums[mid] > nums[end]){ //rotate in the right
                return dfs(nums, mid+1,end);
            }
            else{ //rorate in the left
                return dfs(nums, start, mid);
            }
        }
    };
  • 相关阅读:
    leetcode之String to Integer (atoi)
    初次思考
    leetcode之Reverse Words in a String
    Leetcode之Database篇
    在项目中添加类
    创建项目
    配置Eclipse

    递归
    多态
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/6291529.html
Copyright © 2011-2022 走看看