[leetcode]153. Find Minimum in Rotated Sorted Array

原创 2016年08月28日 15:02:22
class Solution {
public:
    int findMin(vector<int>& nums) {
        int len=nums.size();
        return find(nums,0,len-1);
    }
    int find(vector<int>&nums,int l,int r )
    {
        if(l==r)
            return nums[l];
        int m=(l+r)/2;
        
        if(nums[l]<=nums[m]&&nums[m]<=nums[r])
        
            return nums[l];
        if(nums[l]>=nums[m]&&nums[m]>=nums[r])
            return nums[r];
            
        if(nums[l]>nums[r]&&nums[m]<nums[r])
        
            return find(nums,l,m);
            
        return find(nums,m,r);
        
    }
};

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

[leetcode] 153.Find Minimum in Rotated Sorted Array

题目: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 ...

【leetcode】153. Find Minimum in Rotated Sorted Array

【leetcode】153. Find Minimum in Rotated Sorted Array

【leetcode】No.153 Find Minimum in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 mig...

Leetcode 153. Find Minimum in Rotated Sorted Array

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

※ Leetcode - Binary Search - 153. Find Minimum in Rotated Sorted Array(二分查找)

1. Problem Description Suppose a sorted array is rotated at some pivot unknown to you beforehand.   ...

[leetcode 153]Find Minimum in Rotated Sorted Array----求旋转数组的最小值

Question: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., ...

leetcode解题之153&154. Find Minimum in Rotated Sorted Array版(在旋转的数组中查找最小数字)

leetcode解题之153&154. Find Minimum in Rotated Sorted Array版(在旋转的数组中查找最小数字)

【LeetCode-面试算法经典-Java实现】【153-Find Minimum in Rotated Sorted Array(找旋转数组中的最小数字)】

【153-Find Minimum in Rotated Sorted Array(找旋转数组中的最小数字)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Suppose...

Find Minimum in Rotated Sorted Array - LeetCode 153

题目描述: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 ...

LeetCode - 153. Find Minimum in Rotated Sorted Array

O(n)和使用Arrays.sort(nums)的方法就不再写了。真是各种花式使用二分搜索啊...二分搜索的关键点在与left,right指针移动条件的判定,这道题目的判定条件非常巧妙。使用nums[...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)