阿清11111

分类

/ 注册

全部文章（共6篇）

题解 | 二叉树的最大深度

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

2025-05-14

0 50

题解 | 二叉树的前序遍历

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

2025-05-14

0 50

题解 | 二叉树的中序遍历

class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None class Solution: def inorderTra...

2025-05-14

0 71

题解 | 小红的圆构造

import math x_p, y_p = map(int, input().split()) sum_xy = x_p + y_p sqrt_part = math.sqrt(2 * x_p * y_p) r1 = sum_xy - sqrt_part r2 = sum_xy + sqrt...

2025-05-13

0 57

题解 | 小红的棋盘

n,m=map(int,input().split()) board=[input().strip() for _ in range(n)] count=0 points=[] point_set=set(points) for i in range(n): for j in range(...

2025-05-13

0 69

题解 | 讨厌鬼的区间

l1,r1,l2,r2,l3,r3 = map(int,input().split()) zorn=[(l1,r1),(l2,r2),(l3,r3)] sum_max=-1 for i in range(3): for j in range(3): if i==j: ...

2025-05-13

0 46