offer超级多多

分类

/ 注册

全部文章（共55篇）

题解 | #多组_二维数组_T组形式#

#include <iostream> using namespace std; int main(){ int t, n, m, a; cin >> t; for (int tt = 0; tt < t; tt++) { lo...

2024-10-30

0 28

题解 | #单组_二维数组#

#include <iostream> using namespace std; int main(){ int n, m; cin >> n >> m; long long a = 0; long long sum = 0; ...

2024-10-30

0 29

题解 | #多组_一维数组_T组形式#

#include <iostream> using namespace std; int main(){ int t, n; int a, b; long long sum;#int会溢出 cin >> t; for (int i =...

2024-10-30

0 27

题解 | #单组_一维数组#

#include <iostream> using namespace std; int main() { int n; long long sum = 0;#int 会有溢出错误 cin >> n; for(int i=0,j; i <...

2024-10-30

0 53

题解 | #合并两个排序的链表#

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

2024-10-27

0 24

题解 | #反转链表#

class Solution: def ReverseList(self, head: ListNode) -> ListNode: prev = None current = head while current: ...

2024-10-26

0 39

题解 | #【模板】链表#

n = int(input()) l = [] for _ in range(n): a = input().split() if a[0] == 'insert': x = int(a[1]) y = int(a[2]) if x i...

2024-10-24

0 24

题解 | #【模板】循环队列#

n,q = map(int, input().split()) l =[] for i in range(q): a = input().split() if a[0] == 'push': if len(l) < n: l.insert...

2024-10-23

0 23

题解 | #【模板】队列#

n = int(input()) l = [] for i in range(n): a = input().split() if a[0] == 'push': l.insert(0,a[1]) elif a[0] == 'pop' and len(l) !...

2024-10-21

0 35

题解 | #表达式求值#

# # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # 返回表达式的值 # @param s string字符串待计算的表达式 # @return int整型 # class Solution: def solve(self , s: str) ->...

2024-09-27

0 71