153. Find Minimum in Rotated Sorted Array
来源:互联网 发布:cnabs 中国专利数据库 编辑:程序博客网 时间:2024/06/18 08:00
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.
Subscribe to see which companies asked this question.
题意:找出升序数组旋转后最小值。旋转后的数组分三种情况
0 1 2 4 5 6 77 0 1 2 4 5 64 5 6 7 0 1 2
都有个特性,因为是升序所以,当nums[mid] < nums[r]的时候最小值肯定在左边了
class Solution {public: int findMin(vector<int>& nums) { int l, r, mid; l = 0, r = nums.size() - 1; while(l <= r){ mid = l + (r - l) / 2; if(nums[mid] < nums[r]){ r = mid; } else if(nums[mid] > nums[r]){ l = mid + 1; } else if(nums[mid] == nums[r]) break; } return nums[l]; }};
阅读全文
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
- gsoap编译(仅供自己参考)
- 22异常处理
- 以太坊连载(十一):以太坊账户管理
- ObjectSpace模块
- C++引用
- 153. Find Minimum in Rotated Sorted Array
- MySQL修改表结构操作命令总结
- Android面试
- JS的事件冒泡事件和事件捕获分析
- 微信小程序之-返回上一页
- EasyUI和extjs
- scala学习笔记(三)
- 以太坊连载(十二):创建安全多签名钱包及高级设置
- Java GC