lacker - 博客园

2017年11月12日

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/path-sum-ii/ * * * Given a binary tree and a sum, find all root-to-... 阅读全文

posted @ 2017-11-12 22:35 lacker 阅读(141) 评论(0) 推荐(0) 编辑

leetcode — path-sum

摘要： ``` / Source : https://oj.leetcode.com/problems/path sum/ Given a binary tree and a sum, determine if the tree has a root to leaf path such that addin 阅读全文

posted @ 2017-11-12 22:34 lacker 阅读(132) 评论(0) 推荐(0) 编辑

2017年11月10日

leetcode — minimum-depth-of-binary-tree

摘要： ``` / Source : https://oj.leetcode.com/problems/minimum depth of binary tree/ Given a binary tree, find its minimum depth. The minimum depth is the nu 阅读全文

posted @ 2017-11-10 08:18 lacker 阅读(113) 评论(0) 推荐(0) 编辑

leetcode — balanced-binary-tree

摘要： ``` / Source : https://oj.leetcode.com/problems/balanced binary tree/ Given a binary tree, determine if it is height balanced. For this problem, a hei 阅读全文

posted @ 2017-11-10 08:17 lacker 阅读(168) 评论(0) 推荐(0) 编辑

2017年11月9日

leetcode — convert-sorted-list-to-binary-search-tree

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/convert-sorted-list-to-binary-search-tree/ * * * Given a singly lin... 阅读全文

posted @ 2017-11-09 21:58 lacker 阅读(178) 评论(0) 推荐(0) 编辑

leetcode — convert-sorted-array-to-binary-search-tree

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * Source : https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ * * Given an array wh... 阅读全文

posted @ 2017-11-09 21:57 lacker 阅读(139) 评论(0) 推荐(0) 编辑

leetcode — construct-binary-tree-from-preorder-and-inorder-traversal

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * Source : https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ * * *... 阅读全文

posted @ 2017-11-09 08:18 lacker 阅读(215) 评论(0) 推荐(0) 编辑

leetcode — construct-binary-tree-from-inorder-and-postorder-traversal

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ * * * G... 阅读全文

posted @ 2017-11-09 08:18 lacker 阅读(203) 评论(0) 推荐(0) 编辑

leetcode — maximum-depth-of-binary-tree

摘要： ``` / Source : https://oj.leetcode.com/problems/maximum depth of binary tree/ Given a binary tree, find its maximum depth. The maximum depth is the nu 阅读全文

posted @ 2017-11-09 00:48 lacker 阅读(112) 评论(0) 推荐(0) 编辑

leetcode — binary-tree-zigzag-level-order-traversal

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; / Source : https://oj.leetcode.com/problems/binary tree zigzag level o 阅读全文

posted @ 2017-11-09 00:47 lacker 阅读(141) 评论(0) 推荐(0) 编辑

lack

the quieter you become，the more you are able to hear

公告