leetcode,DFS
piyalo
这个作者很懒,什么都没留下…
展开
-
leetcode Symmetric Tree
Description:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \原创 2017-09-26 21:06:17 · 181 阅读 · 0 评论 -
leetcode DFS
图的遍历为从图中某一顶点出发访遍图中其余顶点,且使每一个顶点仅被访问一次的过程。原创 2017-10-07 18:06:12 · 193 阅读 · 0 评论 -
leetcode Palindrome Partitioning
Description:Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return[ [原创 2017-11-05 16:42:43 · 107 阅读 · 0 评论