153. Find Minimum in Rotated Sorted Array
来源:互联网 发布:关于网络舆论的法律 编辑:程序博客网 时间:2024/06/07 03:59
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., 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.
分析:二分搜索法,即使旋转过了也会一半的任何一个元素始终比另一半的任何一个元素大,所以如果nums[mid] < nums[high],说明最小元素一定在[left, mid]中,所以令high = mid;否则一定在[mid + 1, high]中,令low = mid + 1~~
class Solution {public: int findMin(vector<int>& nums) { int low = 0, high = nums.size() - 1; while(low < high) { int mid = (low + high) / 2; if(nums[mid] < nums[high]) high = mid; else low = mid + 1; } return nums[low]; }};
0 0
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array **
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- Linux终端下 dstat 监控工具
- 第2章Java语言基础
- 关于js的callback回调函数以及嵌套回调函数的执行过程理解
- 运行sosreport导致OL7.3操作系统crash
- 使用IDEA创建Struts项目
- 153. Find Minimum in Rotated Sorted Array
- 209. Minimum Size Subarray Sum
- html,css简单仿站之建材网
- JAVA高精度1_大数相加_阶乘
- 重心-[Codeforces709E] Centroids
- linux文件系统
- Nginx源码阅读(ngx_pool_t)
- 基于环信的仿QQ即时通讯的简单实现
- boolan——c++学习笔记之内存分配