2017年1月17日

154. Find Minimum in Rotated Sorted Array II (Array; Divide-and-Conquer)

摘要： 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 th 阅读全文

posted @ 2017-01-17 01:09 joannae 阅读(192) 评论(0) 推荐(0)

153. Find Minimum in Rotated Sorted Array (Array; Divide-and-Conquer)

摘要： 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 th 阅读全文

posted @ 2017-01-17 00:48 joannae 阅读(144) 评论(0) 推荐(0)

导航