Find Minimum in Rotated Sorted Array
来源:互联网 发布:d2d网络 编辑:程序博客网 时间:2024/06/02 03:13
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.
二分查找实现:
class Solution {public: int binarySearch(vector<int> &num, int begin, int end){if(begin == end) return num[begin];if(num[begin] < num[end]) return num[begin];else{int mid = (end - begin)/2 + begin;if(num[begin] < num[mid]) return binarySearch(num, mid+1, end);else if(num[begin] > num[mid]) return binarySearch(num, begin, mid);else return num[begin] < num[end] ? num[begin] : num[end];}}int findMin(vector<int> &num) { return binarySearch(num, 0, num.size()-1); }};
本题没有考虑有重复元素的情况,如果有重复的元素,就会在比较时总是出现相等而无法判断在哪被掰弯的了。/笑
那样的话难度会增加不少,最差就可以考虑O(n)过一遍了。
0 0
- Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array
- Leetcode: Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array
- 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
- Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array II
- 【Leetcode】Find Minimum in Rotated Sorted Array
- 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
- PHP设置页面字符集utf8
- iOS完整学习路线图
- hdu2167Pebbles dp+状态压缩水题
- Java获取控制台的输入的两个方法
- OC数组排序的基本方法
- Find Minimum in Rotated Sorted Array
- 深入理解javascript闭包【整理】
- windows下调试软件错误记录
- 使用angularjs实现二级联动需要注意的问题如下
- UI第十二课
- NAND FLASH 理解
- Android 自定义Toast
- java程序猿应该了解的10个面向对象设计原则(每次看都很有感悟,特意拿来和大家共享)
- Ruby bundle命令详解