unique琪殿

分类

题解(6)

/ 注册

全部文章（共20篇）

题解 | 穷哈哈~

N = int(input()) S = input() maxL = curL = 0 for i in range(N): if S[i] in ("a", "h"): # 符合要求 if i == 0: ...

2025-09-02

2 12

题解 | 特殊城市

N = int(input()) counts = {} # S:C # 或使用 counts = defaultdict(int) 设定默认值为0 for _ in range(N): S, C = input().split() prefix = S[:2] if n...

2025-09-01

1 14

题解 | 生词篇章查询

N = int(input()) S = {} for i in range(N): line = input().split() S[i] = line[1:] # 存文档 w = {} M = int(input()) for i in range(M): res =...

2025-09-01

1 14

题解 | 字母异位词的长度

from collections import Counter class Solution: def isCongruent(self, s: str, c: str) -> int: if len(s) != len(c): return...

2025-09-01

1 12

题解 | 插队

class Node: __slots__ = ("val", "pre", "next") def __init__(self, val: str): self.val: str = val ...

2025-09-01

1 14

题解 | 无限长正整数排列字符串

n = int(input()) length = 1 # 当前数字的位数 count = 9 # 当前位数的数字的总个数(1位数有9个,2位数有90个,等等) start = 1 # 当前位数的起始数字(1位数从1开始,2位数从10开始,等等) while n > length *...

2025-08-29

1 12

题解 | 添加逗号

N = input() result = [] count = 0 for i in range(len(N) - 1, -1, -1): result.append(N[i]) count += 1 if count % 3 == 0 and i != 0: ...

2025-08-28

1 12

题解 | 上三角矩阵判定

def is_upper_triangular(matrix): n = len(matrix) for i in range(n): for j in range(i): if matrix[i][j] != 0: ...

2025-08-28

1 12

题解 | 禁止重复注册

current_users = ["Niuniu", "Niumei", "GURR", "LOLO"] new_users = ["GurR", "Niu Ke Le", &qu...

2025-08-27

1 15

题解 | #快乐数#

解题要点：通过列举可发现规律：所有不快乐数的数位平方和计算，最终都会进入 4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 → ··· 的循环中。所以只要某轮转换结果sum为以上8个数字中的任意一个数字，都会进入循环，即可判断该数不是快乐数。代码实现...

2023-07-24

1 557