2014年3月19日
LeetCode Distinct Subsequences
摘要： Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2014-03-19 23:57 卖程序的小歪 阅读(167) 评论(0) 推荐(0) 编辑
LeetCode Binary Tree Postorder Traversal
摘要： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文
posted @ 2014-03-19 01:23 卖程序的小歪 阅读(152) 评论(0) 推荐(0) 编辑