Find Minimum in Rotated Sorted Array
来源:互联网 发布:tv远程控制软件 编辑:程序博客网 时间:2024/06/07 02:27
题目名称
Find Minimum in Rotated Sorted Array—LeetCode链接
描述
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.
分析
从1开始遍ector,如果大于前一个数,则继续遍历,知道找到比前面一个数小的数,即为最小元素,如果一次遍历没有发现,则返回第一个数,时间复杂度为Ο(n).
C++代码
class Solution {public: int findMin(vector<int>& nums) { int i=1; int size = nums.size(); while(i<size && nums[i]>nums[i-1]){ i++; } if(i<size) return nums[i]; else return nums[0]; }};
总结
一开始以为是个很难的题目,想到用二分法或者分治法,但是觉得可能一次遍历跟好,所以这道题的难度应该放到Easy里面。
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
- 一篇很好的关于Android的本科毕业论文《基于android手机通讯录的设计与实现毕业论文》转自百度
- Leetcode122: 3Sum Closest
- 环形进度条CircleProgress
- org.springframework.util.StringUtils的使用
- 用两个栈实现一个队列
- Find Minimum in Rotated Sorted Array
- MySQL InnoDB 共享表空间和独立表空间
- Android实战技巧:为从右向左语言定义复杂字串,代码和xml设置
- 如何进行iOS性能测试-------Instruments 使用教程
- 微信企业号接入时InvalidKeyException处理
- 行链接消除测试
- 什么是 MIME Type?
- ——黑马程序员——C语言基础--sizeof运算符和strlen 函数的区别总结
- 最短路——SPFA