![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
彰彰大人
我还是个小学生
展开
-
LeetCode No.153 Find Minimum in Rotated Sorted Array
/** 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 e原创 2017-03-17 15:13:35 · 364 阅读 · 0 评论 -
LeetCode No.154 Find Minimum in Rotated Sorted Array II
/** Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are allowed?Would this affect the run-time complexity? How and why? Suppose an array sorted in ascending order is rotated at原创 2017-03-18 21:47:56 · 175 阅读 · 0 评论