2015年4月2日
[LeetCode] Interleaving String
摘要： Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="... 阅读全文
posted @ 2015-04-02 17:15 穆穆兔兔 阅读(232) 评论(0) 推荐(0) 编辑
[LeetCode] Unique Binary Search Trees II
摘要： Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2015-04-02 16:44 穆穆兔兔 阅读(180) 评论(0) 推荐(0) 编辑
[LeetCode] Unique Binary Search Trees
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2015-04-02 16:02 穆穆兔兔 阅读(156) 评论(0) 推荐(0) 编辑