二分搜索
jjfly
无他,唯手熟尔
展开
-
Search in Rotated Sorted Array I && II
对翻过一次的排序数组二分查找,要利用好已排序这个条件class Solution {public: int search(int A[], int n, int target) { int left = 0, right = n-1; while(left <= right){ int mid = (left+right)/2原创 2015-01-28 16:20:02 · 578 阅读 · 0 评论 -
Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next() and原创 2015-01-27 21:07:19 · 561 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.求树的一点到另一点的最大路径,利用递归的方法,ans 在 左子树,右子树,root+左+右的最大中产生。/** * Definition for binary tree * struct原创 2015-01-27 20:24:19 · 546 阅读 · 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 order of O(log n).If the target is not found in原创 2015-01-29 00:22:23 · 584 阅读 · 0 评论 -
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 row are sorted from left to right.The first integer of each原创 2015-01-29 00:36:28 · 609 阅读 · 0 评论 -
Median of Two Sorted Arrays
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).用二分的方法求合并数组的中值。用找第k大的值来求,不断去掉较小的一半,原创 2015-01-29 11:20:45 · 593 阅读 · 0 评论 -
Balanced Binary Tree
检测一个树是否平衡,不需要求出高度,而是从底到顶检测是否平衡,这样才算法时间复杂度为O(n)。但是需要额外的O(logn)的空间/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(原创 2015-01-27 21:19:31 · 539 阅读 · 0 评论 -
Find Minimum in Rotated Sorted Array I && II
这些题比较考验边界条件Find Minimum in Rotated Sorted Array class Solution {public: int findMin(vector &num) { int left = 0, right = num.size()-1; while(num[left] > num[right]){原创 2015-01-30 18:40:38 · 577 阅读 · 0 评论