刚毕业的小白菜

分类

/ 注册

全部文章（共26篇）

题解 | 【模板】拓扑排序

from collections import defaultdict class Graph: def __init__(self) -> None: self.gragh = defaultdict(list) def add_egde(self,...

2025-05-01

0 15

题解 | 删除链表的节点

# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @para...

2025-05-01

0 17

题解 | 【模板】链表

class ListNode: def __init__(self) -> None: self.node = [] def insert(self, x: int, y: int): if x in self.node: ...

2025-04-12

0 17

题解 | 逆波兰表达式求值

import re from re import A # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param tokens string字符串一维数组 # @return int整型 # class Solution: def eval...

2025-04-05

0 32

题解 | 栈的压入、弹出序列

# # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param pushV int整型一维数组 # @param popV int整型一维数组 # @return bool布尔型 # class Solution: def IsPopOrde...

2025-04-05

0 21

题解 | 【模板】栈

import sys class Stack(): def __init__(self) -> None: self.item = [] def push(self, x): self.item.append(x) def pop(se...

2025-04-05

0 12

题解 | 单组_spj判断数组之和

n, m = map(int, input().split()) array = [] count = 1 for i in range(n): if i == n - 1: count = m - sum(array) print(count, end="...

2025-04-02

0 29

题解 | 单组_spj判断浮点误差

PAI = 3.1415926 r = int(input()) area = PAI * r * r print(area)

2025-04-02

0 21

题解 | 单组_spj判断YES与NO

n = int(input()) if n % 2 == 0: print("NO") else: print("YES")

2025-04-02

0 27

题解 | 单组_补充前导零

n = int(input()) print(f"{n:09d}")

2025-04-02

0 17