offer超级多多

分类

/ 注册

全部文章（共55篇）

题解 | #点击消除#

stack = [] s = input() for i in s: if len(stack) == 0: stack.append(i) else: if stack[-1] == i: stack.pop() ...

2024-09-27

0 71

题解 | #逆波兰表达式求值#

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

2024-09-25

0 64

题解 | #有效括号序列#

class Solution: def isValid(self, s: str) -> bool: # 循环替换，直到字符串为空或者不变 while True: ori = s s = s.replace...

2024-09-25

0 66

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

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

2024-09-25

0 62

题解 | #【模板】栈#

a = int(input()) b = [] for j in range(a): i = input().split() if str(i[0]) == "push": b.append(i[1]) if str(i[0]) == &...

2024-09-25

0 58

题解 | #【模板】栈#

a = int(input()) b = [] for j in range(a): i = input().split() if str(i[0]) == "push": b.append(i[1]) if str(i[0]) == &...

2024-09-24

0 58

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

n,m = map(int,input().split()) for i in range(n-1): print(1,end=" ") print(m-n+1)

2024-09-24

0 81

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

r = int(input()) s = 3.1415926 * r * r print(s)

2024-09-24

1 76

题解 | #单组_spj判断YES与NO#

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

2024-09-24

0 80

题解 | #单组_补充前导零#

a = input() print(a.rjust(9,"0"))

2024-09-24

0 61