爱读书的菠萝蜜很想去杭州

分类

/ 注册

全部文章（共45篇）

题解 | 反转链表

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

2025-06-17

0 23

题解 | 【模板】链表

class ListNode: def __init__(self, data): self.data = data self.next = None class LinkedList: def __init__(self): se...

2025-06-17

0 26

题解 | 活动安排

n = int(input()) a = [list(map(int, input().split())) for _ in range(n)] #获取区间列表 a.sort(key=lambda x: (x[0], x[1])) #将区间先按照区间开头从大到小排序，再按照区间结尾从大到小排序 st...

2025-06-15

0 39

题解 | 【模板】队列操作

n = int(input()) from collections import deque q = deque() for _ in range(n): a = input().split() if a[0] == '1': q.append(int(a[1])) ...

2025-06-11

0 21

题解 | 栈和排序

#之前那个思路不太完善，不知道为什么通过了。 n = int(input()) p = list(map(int, input().split())) pushed = [] popped = [] for ele in p: pushed.append(ele) if pushed...

2025-06-11

0 23

题解 | 验证栈序列

[亲亲] #看不懂题目的朋友可以先做下一道题目，然后再回来做这道，就能简单很多。 q = int(input()) for _ in range(q): n = int(input()) pushed = input().split() popped = input().sp...

2025-06-11

0 24

题解 | 栈和排序

n = int(input()) p = list(map(int, input().split())) pushed = [] popped = [] for ele in p: pushed.append(ele) if ele == n: pushed.pop(...

2025-06-11

0 26

题解 | 吐泡泡

t = int(input()) from collections import deque for _ in range(t): s = input() stack = deque() for char in s: if not stack: ...

2025-06-10

1 15

题解 | 好串

s = input() while s.find('ab')!=-1: s = s.replace('ab','') if len(s) != 0: print('Bad') else: print('Good')

2025-06-10

1 25

题解 | 添加逗号

n = input() n_re = n[::-1] result = '' for i in range(1,len(n)+1): if i%3 == 0: result += n_re[i-1] + ',' else: result += n_re...

2025-06-09

0 20