leetcode解题方案--154--Find Minimum in Rotated Sorted Array II
来源：互联网 发布：淘宝售假扣分权重恢复 编辑：程序博客网 时间：2024/06/10 05:09
题目
Follow up for “Find Minimum in Rotated Sorted Array”:
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
分析
题目改成了可能会重复，经典测试例是【1，1，1，10，10】
所以要考虑相等的情况。如果遇到相等，就–
class Solution { public static int findMin(int[] nums) { int low = 0; int high = nums.length-1; if (nums[high] > nums[low]) { return nums[low]; } while (high - low >1) { int mid = (high + low)/2; if (nums[mid] < nums[high]) { high = mid; } else if (nums[mid] > nums[high]){ low = mid; } else { high--; } } return nums[high]; }}阅读全文
0 0
- leetcode解题方案--154--Find Minimum in Rotated Sorted Array II
- leetcode解题方案--153--Find Minimum in Rotated Sorted Array
- LeetCode 154 Find Minimum in Rotated Sorted Array II
- leetcode 154: Find Minimum in Rotated Sorted Array II
- [leetcode 154] Find Minimum in Rotated Sorted Array II
- LeetCode(154) Find Minimum in Rotated Sorted Array II
- [LeetCode 154]Find Minimum in Rotated Sorted Array II
- Leetcode[154]-Find Minimum in Rotated Sorted Array II
- LeetCode---(154)Find Minimum in Rotated Sorted Array II
- [Leetcode 154, Hard] Find Minimum in Rotated Sorted Array II
- leetcode 154 : Find Minimum in Rotated Sorted Array II
- Leetcode #154 Find Minimum in Rotated Sorted Array II
- 【leetcode】No.154 Find Minimum in Rotated Sorted Array II
- 154 Find Minimum in Rotated Sorted Array II [Leetcode]
- LeetCode（154） Find Minimum in Rotated Sorted Array II
- Leetcode 154: Find Minimum in Rotated Sorted Array II
- 【LeetCode-154】Find Minimum in Rotated Sorted Array II
- LeetCode 154 Find Minimum in Rotated Sorted Array II
- 学习资源
- 输入一棵二叉树，判断该二叉树是否是平衡二叉树。
- 关于这个博客
- C
- Fresco，EventBus，GreenDao，Butterknife，Retrofit 的结合使用
- leetcode解题方案--154--Find Minimum in Rotated Sorted Array II
- C/C++中volatile关键字详解
- 操作系统---文件管理 模拟
- jQuery学习笔记（二）
- 深度学习DeepLearning.ai系列课程学习总结：7. 深层神经网络理论学习
- C#网络编程系列文章(一)之Socket实现异步TCP服务器
- Linux实用命令
- Java生成随机数
- VGG_VOC0712_SSD_300x300_train
