【Leetcode】Find Minimum in Rotated Sorted Array II
来源:互联网 发布:php 高级算法 编辑:程序博客网 时间:2024/04/30 00:46
这道题的思路是直接找旋转数组中的最小值,但是允许出现重复元素的情况
目标依然是通过移动左指针让左指针到达最小值
情况讨论:
情况1:num[left]<num[middle],最小值一定不在这里,所以去middle+1~right找
情况2:num[left]>num[middle],最小值一定在这里,所以去left~middle里找
情况3:num[left]==num[middle],这个时候无法比较,只有通过移动左指针直到可以比较为止。
比如[10,10,10,1,10]
只有一直移动左指针直到左指针指向1才能比较
所以最坏情况时间复杂度是O(N)
public int findMin(int[] num) {int left = 0;int right = num.length - 1;while (left < right) {if (num[left] < num[right])return num[left];int middle = (left + right) / 2;if (num[left] < num[middle])left = middle + 1;else if (num[left] > num[middle])right = middle;elseleft++;}return num[left];}
0 0
- LeetCode Find Minimum in Rotated Sorted Array & LeetCode Find Minimum in Rotated Sorted Array II
- leetCode -Array 154. Find Minimum in Rotated Sorted Array II
- [Leetcode]Find Minimum in Rotated Sorted Array I & II
- LeetCode 154 Find Minimum in Rotated Sorted Array II
- [LeetCode] Find Minimum in Rotated Sorted Array II
- LeetCode: Find Minimum in Rotated Sorted Array II
- 【Leetcode】Find Minimum in Rotated Sorted Array II
- Find Minimum in Rotated Sorted Array II -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array II
- LeetCode之Find Minimum in Rotated Sorted Array II
- leetcode Find Minimum in Rotated Sorted Array II
- leetcode - Find Minimum in Rotated Sorted Array II
- leetcode:Find Minimum in Rotated Sorted Array II
- [leetcode] Find Minimum in Rotated Sorted Array II
- [Leetcode]Find Minimum in Rotated Sorted Array I & II
- Find Minimum in Rotated Sorted Array II c++ leetcode
- leetcode:Find Minimum in Rotated Sorted Array II
- 【LeetCode】【Solution】Find Minimum in Rotated Sorted Array I & II
- 「最长单调序列变形」 最大前缀链
- Servlet学习
- Rotate List
- lamp架构源码安装
- 手机第三方支付产品安全性
- 【Leetcode】Find Minimum in Rotated Sorted Array II
- Remove Nth Node From End of List
- poj 3356 文本编辑距离
- Maximum Product Subarray
- [Leetcode] Search in Rotated Sorted Array
- PostgreSQL的特性
- USACO Picture 解题报告
- 2014年的双11背后会隐藏什么猫腻?
- 双11背后隐藏的猫腻:商品先提价再做降价促销