2015年4月10日
[LeetCode] Populating Next Right Pointers in Each Node II
摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2015-04-10 17:04 穆穆兔兔 阅读(203) 评论(0) 推荐(0) 编辑
[LeetCode] Populating Next Right Pointers in Each Node
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2015-04-10 16:28 穆穆兔兔 阅读(192) 评论(0) 推荐(0) 编辑
[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 @ 2015-04-10 14:26 穆穆兔兔 阅读(182) 评论(0) 推荐(0) 编辑
[LeetCode] Path Sum II
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2015-04-10 14:05 穆穆兔兔 阅读(182) 评论(0) 推荐(0) 编辑
Git 的使用
摘要： Ubuntu 下配置 Git 是一个快速、可扩展的分布式版本控制系统，它具有极为丰富的命令集，对内部系统提供了高级操作和完全访问。 一、Git安装： 1、 二进制方式安装： $ sudo apt-get install git-core 安装完成后，在终端中输入 git 就可以看到相关的命令了。如果 阅读全文
posted @ 2015-04-10 11:29 穆穆兔兔 阅读(322) 评论(0) 推荐(0) 编辑
[LeetCode] Path Sum
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2015-04-10 10:48 穆穆兔兔 阅读(193) 评论(0) 推荐(0) 编辑