lee23333

分类

题解(43)

/ 注册

全部文章（共80篇）

题解 | #滑动窗口的最大值#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param num int整型一维数组 * @...

2023-10-09

0 262

题解 | #有效括号序列#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param s string字符串 * @re...

2023-10-08

0 295

题解 | #包含min函数的栈#

import java.util.*; import java.util.Stack; public class Solution { int[] stack = new int[300]; int tail = -1; int[] mins = new int[...

2023-10-08

0 198

题解 | #用两个栈实现队列#

import java.util.*; import java.util.Stack; public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Intege...

2023-10-08

0 230

题解 | #输出二叉树的右视图#

import java.util.*; public class Solution { ArrayList<Integer> list = new ArrayList<>(); /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回...

2023-10-08

0 469

题解 | #重建二叉树#

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

2023-10-08

0 254

题解 | #序列化二叉树#

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

2023-09-10

0 304

题解 | #在二叉树中找到两个节点的最近公共祖先#

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

2023-09-10

0 304

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

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

2023-09-08

0 331

题解 | #判断是不是平衡二叉树#

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

2023-09-08

0 302