Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word.Return all such possibl...
分类：
其他好文 时间：
2014-07-17 00:52:21
阅读次数：
376
Generate ParenthesesGivennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a sol...
分类：
其他好文 时间：
2014-07-16 18:07:04
阅读次数：
146
Restore IP AddressesGiven a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"255255...
分类：
其他好文 时间：
2014-07-16 18:03:41
阅读次数：
157
Parencodings
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 19352
Accepted: 11675
Description
Let S = s1 s2...s2n be a well-formed string of parentheses...
分类：
其他好文 时间：
2014-07-14 18:19:13
阅读次数：
271
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...
分类：
其他好文 时间：
2014-07-13 16:53:01
阅读次数：
189
Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
determine if the input string is valid.
The brackets must close in the correct order, "()" and "()[]{}" are
all va...
分类：
其他好文 时间：
2014-07-13 16:11:26
阅读次数：
144
Parentheses Balance
You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
(a)if it is the empty string(b)if A and B are correct, AB is c...
分类：
其他好文 时间：
2014-07-13 15:42:59
阅读次数：
207
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are +, -, *, /.
Each operand may be an integer or another expression.
Some examples:
["2", "1", ...
分类：
其他好文 时间：
2014-07-12 22:43:17
阅读次数：
267
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
For example, given n = 3, a solution set is:
"((()))", "(()())", "(())()", "()(())", "()()...
分类：
其他好文 时间：
2014-07-12 17:37:13
阅读次数：
139
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...
分类：
其他好文 时间：
2014-07-12 17:26:31
阅读次数：
256
