binary search
文章平均质量分 64
小榕流光
这个作者很懒,什么都没留下…
展开
-
[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原创 2015-12-28 16:19:27 · 776 阅读 · 0 评论 -
[leetcode] 4. Median of Two Sorted Arrays 解题报告
题目链接: https://leetcode.com/problems/median-of-two-sorted-arrays/There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run原创 2016-04-30 03:06:07 · 769 阅读 · 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原创 2016-07-16 03:13:27 · 3089 阅读 · 0 评论 -
[leetcode] 222. Count Complete Tree Nodes 解题报告
题目链接:https://leetcode.com/problems/count-complete-tree-nodes/Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binar原创 2016-01-12 06:57:17 · 768 阅读 · 0 评论 -
[leetcode] 50. Pow(x, n) 解题报告
题目链接:https://leetcode.com/problems/powx-n/Implement pow(x, n).思路:使用二分来分治计算,要注意一些特殊情况:奇数和偶数,n=0,为负等情况代码如下:class Solution {public: double myPow(double x, int n) { if(n == 1) r原创 2016-02-21 12:40:47 · 869 阅读 · 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-01-02 15:30:53 · 1001 阅读 · 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-01-02 16:52:18 · 679 阅读 · 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?思路:接上题,上题给的数组是无序的,我们可以利用基原创 2016-03-05 10:19:58 · 1097 阅读 · 0 评论 -
[leetcode] 209. Minimum Size Subarray Sum 解题报告
题目链接:https://leetcode.com/problems/minimum-size-subarray-sum/Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there原创 2015-12-30 14:41:39 · 1415 阅读 · 0 评论 -
[leetcode] 354. Russian Doll Envelopes 解题报告
题目链接:https://leetcode.com/problems/russian-doll-envelopes/You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and on原创 2016-06-09 02:43:51 · 5089 阅读 · 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-01-03 15:59:08 · 678 阅读 · 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-01-02 17:34:44 · 1120 阅读 · 0 评论 -
[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-01-03 17:57:54 · 738 阅读 · 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-01-03 14:14:24 · 1939 阅读 · 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-01-02 11:34:37 · 400 阅读 · 0 评论 -
两个有序数组求第k小元素
和两个数组求中位数有点类似. 思路还是二分查找, 也就是在一个数组中进行二分搜索, 每次比较中点位置元素和另一个数组对应位置的大小关系. 比如要找第K个数, 并且当前搜索到了数组A的x位置, 那么要比较的B数组中的位置应该为(k-x-1), 也就是使得数组A中到索引x的元素个数+B中到(k-x-2)索引的元素个数之和为k, 也就是:A: x x+1B: k-x原创 2016-11-17 10:56:18 · 2266 阅读 · 1 评论