LeetCode OJ Find Minimum in Rotated Sorted Array
来源:互联网 发布:淘宝的地址在哪里设置 编辑:程序博客网 时间:2024/05/21 09:01
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 findMin(vector<int> & num) { if (num.size() == 1) return num[0]; if (num[0] < num[1] && num[0] < num[num.size() - 1]) return num[0]; return num[findGap(num)]; } int findGap(vector<int> & num) { int l = 0, h = num.size() - 1; while (l <= h) { if (l == h - 1) return h; int m = (l + h) / 2; if (num[l] > num[m]) { h = m; } else if (num[m] > num[h]) { l = m; } } return -1; }};
0 0
- [LeetCode OJ]Find Minimum in Rotated Sorted Array
- LeetCode OJ Find Minimum in Rotated Sorted Array II
- LeetCode OJ Find Minimum in Rotated Sorted Array
- LeetCode OJ ——Find Minimum in Rotated Sorted Array
- <LeetCode OJ> 153. Find Minimum in Rotated Sorted Array
- [LeetCode OJ]Find Minimum in Rotated Sorted Array
- leetcode oj java 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
- [LeetCode] Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array
- LeetCode OJ Balanced Binary Tree
- 527B. Error Correct System【string】
- 数控系统_01
- Sicily 11159. Year Award
- 用输入输出流从res/raw中读取信息
- LeetCode OJ Find Minimum in Rotated Sorted Array
- 历届试题 连号区间数 (找规律+枚举)
- java解压Zip压缩包
- nyoj34 韩信点兵
- 观《超能陆战队》未来的“机器人设计师”的必备装备
- Calculator
- android sharedpreferences小谈
- 启耘BOX开始招募小微型企业参与公测
- C++静态成员函数小结(转)