[Leetcode] Find Minimum in Rotated Sorted Array
来源:互联网 发布:江西财经大学网络平台 编辑:程序博客网 时间:2024/06/06 14:19
描述
Suppose a sorted array 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.
一个有序数组,经过循环移位后得到新数组,求新数组中最小的元素。
分析
对于一个循环移位数组,有三种状态:
1. 没有移位,此时
2. 移位,且最小值在
3. 移位,且最小值在
知道了这些之后,就很容易写出对应代码。
相关题目:
Search in Rotated Sorted Array
Search in Rotated Sorted Array II
代码
class Solution {public: int findMin(vector<int>& nums) { if (nums.empty()) return NULL; int lo = 0, hi = nums.size() - 1; if (nums[lo] < nums[hi]) return nums[lo]; while (lo < hi) { int mi = lo + (hi - lo) / 2; if (nums[mi] > nums[hi]) lo = mi + 1; else hi = mi; } return nums[lo]; }};
0 0
- [LeetCode] Find Minimum in Rotated Sorted Array
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode :Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- 【Leetcode】Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- LeetCode: Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode Find Minimum in Rotated Sorted Array
- leetcode - Find Minimum in Rotated Sorted Array
- LeetCode Find Minimum in Rotated Sorted Array
- Leetcode--Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- [leetcode] Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- XML解析之Pull、Sax方式
- C语言的循环
- C++避免程序运行完后窗口一闪而过的方法
- Android基本架构
- js 数组与对象的区别
- [Leetcode] Find Minimum in Rotated Sorted Array
- Javascript中的尾调用如何使用?
- 机器学习系列(11)_Python中Gradient Boosting Machine(GBM)调参方法详解
- hadoop安装和维护06--配置yum源实战
- java源文件中的“成员变量和局部变量的区别”
- Spring security实现权限管理
- 105. Construct Binary Tree from Preorder and Inorder Traversal**
- 程序员面试金典: 9.3栈与队列 3.7猫狗动物队列
- 二维数组中的查找