摘要:
Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,...
阅读全文
posted @ 2014-07-08 23:44
月下美妞1314
阅读(404)
推荐(0)
编辑
摘要:
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))...
阅读全文
posted @ 2014-07-08 23:22
月下美妞1314
阅读(311)
推荐(0)
编辑
摘要:
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...
阅读全文
posted @ 2014-07-08 22:53
月下美妞1314
阅读(197)
推荐(0)
编辑