chong_0428

分类

/ 注册

全部文章（共132篇）

题解 | Zero-complexity Transposition

n = input() s = input().split() a = ' '.join(s[::-1]) print(a)

2025-02-22

0 33

题解 | 2的幂次方

def dsf(s): a = bin(s) s = a[2:] l = len(s) first = True for i in s: l -= 1 if i == '1': if not first:...

2025-02-21

0 39

题解 | 路径打印

class TreeNode: def __init__(self): self.children = {} # 存储子目录 def insert_path(root, path): # 按'\'分割路径 dirs = path.strip('\\').s...

2025-02-20

0 57

题解 | Sum of Factorials

def fac(n): s = 1 if n == 0: return 1 for i in range(1, n+1): s *= i return s def sum_f(n, f, s, i): if s == n: ...

2025-02-20

0 48

题解 | 棋盘游戏

import heapq def dijkstra(grid, x, y, end_x, end_y): rows, cols = 6, 6 visted = set() pq = [(0, x, y, 1)] while pq: cost, x...

2025-02-20

0 45

题解 | Old Bill

def price(a, b, c, n): p = [] di = [] dj = [] tag = 0 for i in range(1, 10): for j in range(10): s = i * 10000...

2025-02-18

0 44

题解 | WERTYU

def create_keyboard_map(): # Define the keyboard rows row1 = "QWERTYUIOP[]" row2 = "ASDFGHJKL;'" row3 = "ZXCV...

2025-02-18

0 40

题解 | String Matching

def getNext(s): next = [0] * len(s) next[0] = 0 j = 0 for i in range(1, len(s)): while j > 0 and s[i] != s[j]: ...

2025-02-18

0 47

题解 | 简单密码

def string_shift(s): res = [] l = len(s) base = ord('A') for i in range(l): if not s[i].isalpha(): res.append(s[i]...

2025-02-17

0 45

题解 | 加减乘除

while True: try: def res(a, b, op): if op == '+': return a+b elif op == '-': retu...

2025-02-17

0 45