牛客459000288号

分类

题解(9)

/ 注册

全部文章（共56篇）

题解 | 健身达人每日步数 | Python O(nlogn)

N = int(input()) if N == 0: print(0) exit() arr = list(map(int, input().split())) # Algo # - Count num2cnt = {} for num in arr: cnt = num...

2026-01-22

0 15

题解 | 小店的经营分析 | Python3

N = int(input()) arr = list(map(int, input().split())) L, R = map(int, input().split()) # Algo arr_acc = [0] * N cnt = 0 for j in range(0, N): nu...

2026-01-22

0 11

题解 | 细胞增殖 | Python3 二分查找

N, M = map(int, input().split()) arr = list(map(int, input().split())) # Algo for _ in range(M): B, S = map(int, input().split()) left, right...

2026-01-21

0 14

题解 | 时津风的资源收集 | Python3

from collections import deque # Build query array. q = deque([(10, 0), (300, 1)]) w = [1e10] * 301 oprs = [1, -1, 10, -10, 100, -100] while q: x...

2026-01-19

0 13

题解 | 实现字通配符* | Python3 通过普通字符串找锚点（556ms）

import re p, s = input(), input() # Algo m, n = len(p), len(s) # - Locate anchors chips = re.split(r"\*+", p) list_anchors = [] if chips[0...

2026-01-16

0 20

题解 | 在字符串中找出连续最长的数字串 | Python3 O(n)

s = input() # Algo endIs, maxLen = [], 0 curLen = 0 for i, ch in enumerate(s): if ch.isdigit(): curLen += 1 if curLen > maxLen...

2026-01-16

0 16

题解 | 字符串通配符 | Python 正则表达式

import re p, s = input(), input() regex = p regex, _ = re.subn(r"([^\*\?\w])", r"\\\1", regex) regex, _ = re.subn(r"\*+"...

2026-01-16

0 13

题解 | 查找两个字符串a,b中的最长公共子串 | Python DP O(m*n)

s, t = input(), input() # DP # 阶段：s前i个字符，t前j个字符 # 状态：以s(i)、t(j)结尾的公共子串长度 if len(s) > len(t): s, t = t, s m, n = len(s)+1, len(t)+1 dp = [0] * n ma...

2026-01-16

0 14

题解 | DNA序列 | Python3 O(n)

s, N = input(), int(input()) # Algo cnt = sum(s[i] == 'C' or s[i] == 'G' for i in range(N)) # Init resEndI, maxCnt = N-1, cnt for i in range(N, len(...

2026-01-16

0 12

题解 | 找出字符串中第一个只出现一次的字符 | Python O(n)

s = input() # Algo ORD_a = ord('a') arr = [0] * 26 for ch in s: arr[ord(ch)-ORD_a] += 1 print(next((x for x in s if arr[(ord(x)-ORD_a)] == 1), &q...

2026-01-16

0 13