lacker - 博客园

2017年11月9日

leetcode — binary-tree-level-order-traversal

摘要： ``` import org.lep.leetcode.binarytreeinordertraversal.BinaryTreeInOrderTraversal; import java.util.ArrayList; import java.util.Arrays; import java.ut 阅读全文

posted @ 2017-11-09 00:46 lacker 阅读(186) 评论(0) 推荐(0)

leetcode — symmetric-tree

摘要： ``` import java.util.Stack; / Source : https://oj.leetcode.com/problems/symmetric tree/ Given a binary tree, check whether it is a mirror of itself (i 阅读全文

posted @ 2017-11-09 00:45 lacker 阅读(195) 评论(0) 推荐(0)

2017年11月8日

leetcode — same-tree

摘要： ``` import java.util.Stack; / Source : https://oj.leetcode.com/problems/same tree/ Given two binary trees, write a function to check if they are equal 阅读全文

posted @ 2017-11-08 08:20 lacker 阅读(153) 评论(0) 推荐(0)

leetcode — recover-binary-search-tree

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.List; /** * Source : https://oj.leetcode.com/problems/recover-binary-search-tree/ * * * Two... 阅读全文

posted @ 2017-11-08 08:18 lacker 阅读(174) 评论(0) 推荐(0)

2017年11月6日

leetcode — validate-binary-search-tree

摘要： ``` import apple.laf.JRSUIUtils; / Source : https://oj.leetcode.com/problems/validate binary search tree/ Given a binary tree, determine if it is a va 阅读全文

posted @ 2017-11-06 08:21 lacker 阅读(268) 评论(0) 推荐(0)

leetcode — interleaving-string

摘要： ``` / Source : https://oj.leetcode.com/problems/interleaving string/ Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For 阅读全文

posted @ 2017-11-06 08:20 lacker 阅读(181) 评论(0) 推荐(0)

2017年11月5日

leetcode — unique-binary-search-trees-ii

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.Calendar; import java.util.List; / https://leetcode.com/problems/unique bina 阅读全文

posted @ 2017-11-05 19:36 lacker 阅读(245) 评论(0) 推荐(0)

leetcode — unique-binary-search-trees

摘要： ``` / Source : https://oj.leetcode.com/problems/unique binary search trees/ Given n, how many structurally unique BST's (binary search trees) that sto 阅读全文

posted @ 2017-11-05 19:35 lacker 阅读(126) 评论(0) 推荐(0)

leetcode — binary-tree-inorder-traversal

摘要： ```java import java.util.Arrays; import java.util.Stack; import java.util.TreeMap; / Source : https://oj.leetcode.com/problems/binary tree inorder tra 阅读全文

posted @ 2017-11-05 19:34 lacker 阅读(148) 评论(0) 推荐(0)

leetcode — restore-ip-addresses

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.List; /** * Source : https://oj.leetcode.com/problems/restore-ip-addresses/ * * * * Given a... 阅读全文

posted @ 2017-11-05 19:30 lacker 阅读(171) 评论(0) 推荐(0)

lack

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

公告