红烧带鱼好吃

题解

/ 注册

全部文章 / 题解（共25篇）

题解 | #树的子结构#

/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = v...

递归

2022-06-05

0 188

题解 | #二叉搜索树的第k个节点#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

自顶向下递归

2022-06-04

0 163

题解 | #按之字形顺序打印二叉树#

import java.util.ArrayList; import java.util.*; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; ...

队列划分层次反转数组

2022-06-03

0 191

题解 | #二叉树中和为某一值的路径(二)#

import java.util.ArrayList; /** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int...

路径维护递归

2022-05-23

0 247

题解 | #二叉树中和为某一值的路径(一)#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * } */ // 递归，把sum根据本级节点的...

递归

2022-05-23

0 203

题解 | #二叉搜索树的最近公共祖先#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

自顶向下二叉搜索

2022-05-23

0 200

题解 | #对称的二叉树#

import java.util.*; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { ...

双队列回文镜像

2022-05-23

0 190

题解 | #判断是不是平衡二叉树（基础版）#

// 自顶向下，两个递归，第一个遍历所有节点，第二个获取子树的高度 // 时间复杂度O（n^2）,空间复杂度O（n） public class Solution { public Integer height(TreeNode root){ if (root == null)...

2022-05-22

0 204

题解 | #从上往下打印二叉树#

import java.util.ArrayList; import java.util.*; /** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; ...

队列

2022-05-22

0 174

题解 | #二叉树的镜像（基础版）#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

递归

2022-05-21

0 197