随笔分类 -  leetcode刷题

上一页 1 2
Sqrt(x)
摘要：Implementint sqrt(int x).Compute and return the square root ofx.思路：binary search ，柯西不等式√abx/mid) b=mid-1; else a=mid+1; } ... 阅读全文
posted @ 2015-03-12 22:06 jasmine_turnsoul 阅读(167) 评论(0) 推荐(0)
Search for a Range
摘要：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 ord... 阅读全文
posted @ 2015-03-12 20:02 jasmine_turnsoul 阅读(115) 评论(0) 推荐(0)
Search a 2D Matrix
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2015-03-12 19:39 jasmine_turnsoul 阅读(158) 评论(0) 推荐(0)
binary search bug
摘要：it's suprised me!but it is a real problem in practice.remember it , change your solid style. 阅读全文
posted @ 2015-03-12 14:56 jasmine_turnsoul 阅读(127) 评论(0) 推荐(0)
Find Minimum in Rotated Sorted Array II
摘要：Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2015-03-12 14:52 jasmine_turnsoul 阅读(112) 评论(0) 推荐(0)
Search in Rotated Sorted Array 【新思路】
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文
posted @ 2015-03-12 13:16 jasmine_turnsoul 阅读(133) 评论(0) 推荐(0)
Find Peak Element
摘要：A peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and return its index.... 阅读全文
posted @ 2015-03-12 10:16 jasmine_turnsoul 阅读(134) 评论(0) 推荐(0)
Find Minimum in Rotated Sorted Array
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2015-03-12 10:06 jasmine_turnsoul 阅读(110) 评论(0) 推荐(0)
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 or... 阅读全文
posted @ 2015-03-11 19:53 jasmine_turnsoul 阅读(141) 评论(0) 推荐(0)

上一页 1 2