永往直前

分类

题解(26)

/ 注册

全部文章（共151篇）

题解 | #有效括号序列#

import java.util.*; public class Solution { /** * * @param s string字符串 * @return(756076230) bool布尔型 */ public boolean ...

2023-02-09

0 286

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

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

2023-02-09

0 273

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

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

2023-02-08

0 225

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

import java.util.*; public class Solution { private Map<Integer, Integer> map = new HashMap<>(); /** * 代码中的类名、方法名、参数名已经指定...

2023-02-08

0 260

题解 | #重建二叉树#

import java.util.*; /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * T...

2023-02-08

0 236

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

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

2023-02-08

0 259

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

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

2023-02-08

0 249

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

public class Solution { public boolean IsBalanced_Solution(TreeNode root) { if (root == null) { return true; } ...

2023-02-08

0 266

题解 | #判断是不是完全二叉树#

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

2023-02-08

0 212

题解 | #判断是不是二叉搜索树#

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

2023-02-07

0 253