Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matr...
分类：
编程语言 时间：
2015-06-15 18:34:55
阅读次数：
1218
Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "...
分类：
其他好文 时间：
2015-06-15 13:09:51
阅读次数：
153
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2015-06-15 00:07:45
阅读次数：
142
Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 ...
分类：
其他好文 时间：
2015-06-15 00:06:44
阅读次数：
112
Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2...
分类：
其他好文 时间：
2015-06-15 00:06:27
阅读次数：
102
Description:Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->...
分类：
其他好文 时间：
2015-06-14 21:14:03
阅读次数：
116
Yada Number
Problem Description:
Every positive integer can be expressed by multiplication of prime integers. Duoxida says an integer is a yada number if the total amount of 2,3,5,7,11,13 in its...
分类：
其他好文 时间：
2015-06-14 20:04:45
阅读次数：
344
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 return
its index.
The array may contain multiple peaks, i...
分类：
其他好文 时间：
2015-06-14 18:40:44
阅读次数：
108
Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note...
分类：
其他好文 时间：
2015-06-14 16:36:08
阅读次数：
119
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2015-06-14 16:30:11
阅读次数：
79
