1、
??
Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subt...
分类：
其他好文 时间：
2014-05-23 08:19:19
阅读次数：
282
上得厅堂，下得厨房，写得代码，翻得围墙，欢迎来到睿不可挡的每日一小练！...
分类：
其他好文 时间：
2014-05-22 11:42:14
阅读次数：
253
【题目】
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).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no du...
分类：
其他好文 时间：
2014-05-22 10:43:12
阅读次数：
310
【题目】
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.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6]...
分类：
其他好文 时间：
2014-05-22 09:41:59
阅读次数：
195
找出单词的最长公共前缀
class Solution {
public:
string longestCommonPrefix(vector &strs) {
int len=strs.size();
if(len==0)
return "";
int length=strs[0].size(),j;
...
分类：
其他好文 时间：
2014-05-22 09:35:20
阅读次数：
230
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:
get and set.
get(key) - Get the value (will always be positive) of the key if t...
分类：
其他好文 时间：
2014-05-22 07:25:32
阅读次数：
254
问题
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given {1,2,3,4}, reorde...
分类：
其他好文 时间：
2014-05-22 07:04:46
阅读次数：
298
【题目】
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 the array, return [-1, -1].
For example,
Given [5...
分类：
其他好文 时间：
2014-05-22 06:44:39
阅读次数：
265
5道题目分别是：【Largest Rectangle in Histogram】、【Minimum Path Sum】、【Jump Game】、【Jump Game II 】、【Valid Number】,由于有一些题目不需要发一整篇博文来记录，所以就将这些题目以一篇博文5道来记录。...
分类：
其他好文 时间：
2014-05-21 03:05:33
阅读次数：
481
【题目】
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
For "(()", the longest valid parentheses substring is "()", which has length = 2.
Another example is ")()())", whe...
分类：
其他好文 时间：
2014-05-20 16:39:07
阅读次数：
280
