二分法
文章平均质量分 68
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 222. Count Complete Tree Nodes(完全二叉树节点数统计)
本人原创,如有错误恳请指正,谢谢!原题网址https://leetcode.com/problems/count-complete-tree-nodes/Given a complete binary tree, count the number of nodes.原创 2016-04-04 13:01:11 · 4283 阅读 · 3 评论 -
LeetCode 69. Sqrt(x)(开平方根)
原题网址:https://leetcode.com/problems/sqrtx/Implement int sqrt(int x).Compute and return the square root of x.方法一:二分法。public class Solution { public int mySqrt(int x) { int i=0,原创 2016-05-22 00:05:17 · 2001 阅读 · 0 评论 -
LeetCode 74. Search a 2D Matrix(搜索矩阵)
原题网址:https://leetcode.com/problems/search-a-2d-matrix/Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each原创 2016-05-22 05:19:08 · 576 阅读 · 0 评论 -
LeetCode 81. Search in Rotated Sorted Array II(搜索旋转的数组)
原题网址:https://leetcode.com/problems/search-in-rotated-sorted-array-ii/Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity原创 2016-05-22 05:30:00 · 397 阅读 · 0 评论 -
LeetCode 367. Valid Perfect Square
原题网址:https://leetcode.com/problems/valid-perfect-square/Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in原创 2016-06-27 09:23:08 · 362 阅读 · 0 评论 -
LeetCode 352. Data Stream as Disjoint Intervals(数据流区间)
原题网址:https://leetcode.com/problems/data-stream-as-disjoint-intervals/Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of dis原创 2016-06-16 01:11:36 · 1562 阅读 · 0 评论 -
LeetCode 374. Guess Number Higher or Lower
原题网址:https://leetcode.com/problems/guess-number-higher-or-lower/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.Eve原创 2016-07-13 23:27:38 · 926 阅读 · 0 评论 -
LeetCode 275. H-Index II(文献)
原题网址:https://leetcode.com/problems/h-index-ii/Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?Hint:Expected runtime c原创 2016-04-13 12:14:37 · 544 阅读 · 0 评论 -
LintCode Find Peak Element(查找峰值)
原题网址:http://www.lintcode.com/en/problem/find-peak-element/There is an integer array which has the following features:The numbers in adjacent positions are different.A[0] A[A.length - 1].原创 2016-06-21 01:38:59 · 1402 阅读 · 0 评论 -
LintCode Find Peak Element II(查找峰值II)
原题网址:http://www.lintcode.com/en/problem/find-peak-element-ii/There is an integer matrix which has the following features:The numbers in adjacent positions are different.The matrix has n rows原创 2016-06-21 03:27:29 · 2970 阅读 · 0 评论 -
LeetCode 57. Insert Interval(插入区间)
原题网址:https://leetcode.com/problems/insert-interval/Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals w原创 2016-05-21 07:40:48 · 500 阅读 · 0 评论 -
LeetCode 50. Pow(x, n)(求幂)
原题网址:https://leetcode.com/problems/powx-n/Implement pow(x, n).方法一:倍乘,迭代。public class Solution { public double myPow(double x, int n) { long ln = (long)n; if (ln < 0) {原创 2016-05-21 06:17:41 · 557 阅读 · 0 评论 -
LeetCode 33. Search in Rotated Sorted Array(旋转数组搜索)
原题网址:https://leetcode.com/problems/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 7 might become 4 5 6 7 0 1 2)原创 2016-05-20 10:36:45 · 491 阅读 · 0 评论 -
LeetCode 278. First Bad Version(首个坏版本)
原题网址:https://leetcode.com/problems/first-bad-version/You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the原创 2016-04-14 01:25:35 · 301 阅读 · 0 评论 -
LeetCode 287. Find the Duplicate Number(找重复数字)
原题网址:https://leetcode.com/problems/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 nu原创 2016-04-15 07:02:18 · 2958 阅读 · 1 评论 -
LeetCode 162. Find Peak Element(查找峰值)
原题网址:https://leetcode.com/problems/find-peak-element/A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and ret原创 2016-05-25 01:40:48 · 2258 阅读 · 0 评论 -
LeetCode 154. Find Minimum in Rotated Sorted Array II(旋转数组查找)
原题网址:https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time原创 2016-05-26 00:57:56 · 464 阅读 · 0 评论 -
LeetCode 153. Find Minimum in Rotated Sorted Array(旋转数组查找)
原题网址:https://leetcode.com/problems/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 7 might become 4 5 6 7原创 2016-05-26 01:02:22 · 432 阅读 · 0 评论 -
LeetCode 302. Smallest Rectangle Enclosing Black Pixels(最小面积矩形)
原题网址:https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are con原创 2016-04-19 07:06:47 · 1643 阅读 · 0 评论 -
LeetCode 12. Integer to Roman(阿拉伯转罗马数字)
原题网址:https://leetcode.com/problems/integer-to-roman/Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.方法:理解罗马数字的规律。二分法。public clas原创 2016-05-19 05:27:37 · 461 阅读 · 0 评论 -
LeetCode 34. Search for a Range(搜索范围)
原题网址:https://leetcode.com/problems/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原创 2016-05-20 10:36:48 · 483 阅读 · 0 评论 -
LeetCode 35. Search Insert Position(搜索插入点)
原题网址:https://leetcode.com/problems/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原创 2016-05-20 10:37:23 · 362 阅读 · 0 评论 -
LeetCode 441. Arranging Coins
原题网址:https://leetcode.com/problems/arranging-coins/You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the to原创 2016-11-19 03:19:43 · 805 阅读 · 0 评论