摘要：
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 阅读全文
posted @ 2015-06-27 11:19
Mr.do
阅读(116)
评论(0)
推荐(0)
摘要：
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. 阅读全文
posted @ 2015-06-27 10:59
Mr.do
阅读(132)
评论(0)
推荐(0)
浙公网安备 33010602011771号