Qadccccc

分类

题解(12)

/ 注册

全部文章（共103篇）

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

import sys # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名...

2025-05-25

0 21

题解 | 合并二叉树-- leetcode617

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-24

0 2

题解 | 二叉搜索树与双向链表 --leetcode LCR155

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # 题解： https://leetcode...

2025-05-24

0 2

题解 | 二叉树的最大深度-递归

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-24

0 21

题解 | 求二叉树的层序遍历

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-24

0 21

题解 | 二叉树的后序遍历-leetcode 题解

from os import NGROUPS_MAX # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = Non...

2025-05-24

0 3

题解 | 二叉树的后序遍历-递归写法

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-24

0 30

题解 | 二叉树的中序遍历-栈的使用

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-24

0 26

题解 | 盛水最多的容器

# # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param height int整型一维数组 # @return int整型 # class Solution: def maxArea(self , height: List[int]) -...

2025-05-23

0 24

题解 | 二叉树的前序遍历 -根 -左节点-右节点递归

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2025-05-23

0 26