2015年1月21日
[LeetCode] Unique Binary Search Trees II dfs 深度搜索
摘要： 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-01-21 23:23 A_zhu 阅读(157) 评论(0) 推荐(0)
[LeetCode] Scramble String 字符串 dp
摘要： Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation... 阅读全文
posted @ 2015-01-21 20:25 A_zhu 阅读(209) 评论(0) 推荐(0)
[LeetCode] Add Two Numbers 链表
摘要： You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文
posted @ 2015-01-21 15:56 A_zhu 阅读(164) 评论(0) 推荐(0)