2014年3月7日
[leetCode]Word Break
摘要： Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For example, givens="leetcode",dict=["leet", "code"].Return true because"leetcode"can be segmented as"leet code&quo 阅读全文
posted @ 2014-03-07 16:11 青轰的后花园 阅读(322) 评论(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 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 ... 阅读全文
posted @ 2014-03-07 09:27 青轰的后花园 阅读(150) 评论(0) 推荐(0) 编辑