码迷,mamicode.com
首页 >  
搜索关键字:assume    ( 1858个结果
LeetCode--Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key.Th...
分类:其他好文   时间:2015-01-14 09:52:48    阅读次数:161
Java-Compare Version Numbers
Compare two version numbers version1 and version1. If version1 > version2 return 1, if version1  version2 return -1, otherwise return 0. You may assume that the version strings are non-empty and c...
分类:编程语言   时间:2015-01-13 20:00:14    阅读次数:190
LeetCode--Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from ...
分类:其他好文   时间:2015-01-13 17:51:17    阅读次数:180
(每日算法)LeetCode -- Merge Sorted Array (合并有序数组)
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from ...
分类:编程语言   时间:2015-01-12 21:01:06    阅读次数:280
[LeetCode] Insert Interval
Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially...
分类:其他好文   时间:2015-01-12 14:28:35    阅读次数:162
Search Insert Position -- leetcode
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 order. You may assume no duplicates in the array. ...
分类:其他好文   时间:2015-01-12 09:27:17    阅读次数:136
LeetCode-Compare Version Numbers
Compare two version numbers version1 and version1. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empty and co...
分类:其他好文   时间:2015-01-12 09:22:09    阅读次数:126
Find the k-th Smallest Element in the Union of Two Sorted Arrays
Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no du...
分类:其他好文   时间:2015-01-11 22:48:15    阅读次数:187
LeetCode--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 order. You may assume no duplicates in the array....
分类:其他好文   时间:2015-01-11 17:53:05    阅读次数:140
LeetCode-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 order. You may assume no duplicates in the array....
分类:其他好文   时间:2015-01-11 09:44:06    阅读次数:137
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!