leetcode_153. Find Minimum in Rotated Sorted Array
来源:互联网 发布:知满天教育官网 编辑:程序博客网 时间:2024/06/05 15:31
题目:
Suppose an array sorted in ascending order 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>& nums) { if(nums[0] <= nums[nums.size()-1]){ return nums[0]; } for(int i = 1; i < nums.size(); ++i){ if(nums[i] < nums[i-1]){ return nums[i]; } } }};
阅读全文
0 0
- leetcode_153. 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
- 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]: 112. Path Sum
- 用户自定义函数
- 线程学习1--pthread_create
- LeetCode Algorithms 47. Permutations II
- 安装anaconda2
- leetcode_153. Find Minimum in Rotated Sorted Array
- java的多态
- 离散数学知识框架小结
- Linux查看DNS
- 硬币排成线I和硬币排成线II问题
- cntk深度网络——从入门到转行一
- React native 技术中 android 和 iOS 平台差异
- linux ipc---消息队列---为什么需要键值 key_t key
- AJAX----核心XMLHttpRequest对象介绍