Binary Search
文章平均质量分 82
ActiveCoder
An active programmer
展开
-
LeetCode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array.原创 2016-04-11 05:53:47 · 183 阅读 · 0 评论 -
LeetCode 287. Find the Duplicate Number
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, f原创 2016-04-11 03:22:06 · 205 阅读 · 0 评论 -
Find minimum number in Rotated sorted array.
if the middle value locates in the first increasing part, the mini value must locate at the lower half, thus, the first pointer should point to the middle instead. if the middle value locates in原创 2016-05-13 11:01:53 · 292 阅读 · 0 评论