二分法
文章平均质量分 62
sscssz
这个作者很懒,什么都没留下…
展开
-
34. Search for a Range【M】【76】
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found原创 2016-02-27 13:59:13 · 349 阅读 · 0 评论 -
【leetcode】69. Sqrt(x)【M】【74】
Implement int sqrt(int x).Compute and return the square root of x.Subscribe to see which companies asked this question二分法,最后再加一个处理这么简单的题目竟然才做。。sighclass Solutio原创 2016-07-05 16:09:16 · 359 阅读 · 0 评论 -
【leetcode】374. Guess Number Higher or Lower【E】
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is h原创 2016-07-15 19:51:45 · 497 阅读 · 0 评论 -
【leetcode】167. Two Sum II - Input array is sorted【M】【100%】
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two number原创 2016-09-06 23:18:17 · 481 阅读 · 5 评论