leetcode:Find Minimum in Rotated Sorted Array 菜鸟解法
来源:互联网 发布:网络海报设计 编辑:程序博客网 时间:2024/06/12 00:27
原来是乱序的数组,如果是顺序的很显然用二分法可以解决,乱序我采用了类似的思想
比较中值和中值左边那个数,如果左边那个比中值大,显然中值就是结果
如果中值左边的数比数组最右小,说明最小值在中值左边,如果大,说明最小值在中值右边
综上,加上一些边界条件,我完成了很粗糙的代码,希望能对其他人有些帮助...
class Solution {public: int findMin(vector<int> &num) { int min = 0,left,right,cur,len; left = 0; len = num.size()-1; right = len; cur = (left+right)/2; if(right<0) return 0; if(num[left]<=num[right]) return num[left]; if(num[right]<num[right-1])return num[right]; while(1){ if(num[cur-1]>num[cur]) return num[cur]; else if(num[cur-1]>num[len]){ left = cur; cur = (left+right)/2; } else if(num[cur-1]<num[len]){ right = cur; cur = (left+right)/2; } } }};
0 0
- leetcode:Find Minimum in Rotated Sorted Array 菜鸟解法
- leetcode:Find Minimum in Rotated Sorted Array II 菜鸟解法
- [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
- Javascript的严格模式
- ASP.Net MVC——Razor视图引擎
- poj 3171Cleaning Shifts 区间覆盖
- ThinkPHP3.2 扩展--钩子,HOOK
- Ubuntu下的crontab
- leetcode:Find Minimum in Rotated Sorted Array 菜鸟解法
- HBase集群的安装部署
- 适配器模式(Adapter)——跟着cc学设计系列
- uva 548
- 8.app后端和web后端的区别
- 把 Win 8.1 升级成 Windows 2012 R2 (续)
- WinSCP链接Linux
- 把 Mac 上的 bash 换成 zsh
- quick-cocos2d-x 学习系列之二样例2048游戏学习