153. Find Minimum in Rotated Sorted Array
2016-09-28 13:48
267 查看
题目:Find Minimum in Rotated Sorted Array
原题链接:https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/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.
将一个排序好的数组首尾串起来组成环,然后任选一个点断开形成新的数组,找到这个数组中最小的元素。
题目也保证没有重复的元素。
从头到尾遍历数组,每次与前一个元素比较,如果小于前一个元素,说明是原先排序好的数组中的头,自然也就是最小的数。
注意可能会出现顺序和之前没变的情况,这个时候不妨先设ans = nums[ 0 ],如果遇到符合元素变小的情况,就重新令 ans 等于变小的数值。
代码如下:
class Solution { public: int findMin(vector<int>& nums) { int len = nums.size(); if(!len) return 0; else if(len == 1) return nums[0]; int ans = nums[0]; for(int i = 1; i < len; ++i) { if(nums[i] < nums[i - 1]) { ans = nums[i]; break; } } return ans; } };
相关文章推荐
- [LeetCode153]Find Minimum in Rotated Sorted Array
- [Leetcode 153 && 154] Find Minimum in Rotated Sorted Array (II)
- 153. Find Minimum in Rotated Sorted Array
- leetcode解题方案--153--Find Minimum in Rotated Sorted Array
- [leetcode 153]Find Minimum in Rotated Sorted Array----求旋转数组的最小值
- 153 Find Minimum in Rotated Sorted Array
- 153_leetcode_Find Minimum in Rotated Sorted Array II
- leetcode 153 —— Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- Leetcode 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 LeetCode
- leetcode-153-Find Minimum in Rotated Sorted Array
- 153. Find Minimum in Rotated Sorted Array
- leetcode-153-Find Minimum in Rotated Sorted Array
- LeetCode 153 Find Minimum in Rotated Sorted Array
- 【LEETCODE】153-Find Minimum in Rotated Sorted Array
- Leetcode[153]-Find Minimum in Rotated Sorted Array
- 153 Find Minimum in Rotated Sorted Array [Leetcode]