binary search
duffywan
这个作者很懒,什么都没留下…
展开
-
Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. public class Solution { public TreeNode sortedArrayToBST(int[] num) { if (num == null) return nu原创 2014-11-07 23:49:25 · 284 阅读 · 0 评论 -
Search Range in Binary Search Tree
Fair Search Range in Binary Search Tree Show Result My Submissions 43% Accepted Given two values k1 and k2 (where k1 Example For example, if k1 = 10 and k2 = 22, then your原创 2014-11-17 08:22:52 · 268 阅读 · 0 评论 -
Median of two Sorted Arrays
class Solution { /** * @param A: An integer array. * @param B: An integer array. * @return: a double whose format is *.5 or *.0 */ public double findMedianSortedArrays(int[原创 2014-11-16 02:26:41 · 396 阅读 · 0 评论