weixin_44013557的博客

面试题 04.09. 二叉搜索树序列 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public void FF(List<Integer> a, Lis

208. 实现 Trie (前缀树) class Trie { class TrieNode { private char val; private boolean isLeaf; TrieNode[] next; public TrieNode() { this.next = new TrieNode[26]; } public TrieNode(char val) {

LeetCode刷题记169 1028. 从先序遍历还原二叉树 题目 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val

LeetCode刷题记164 297. 二叉树的序列化与反序列化 题目 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Codec { // Encodes a tree