卖窝瓜的大大怪

分类

/ 注册

全部文章（共16篇）

题解 | #计算字符串的编辑距离#

import sys m = input() n = input() if len(m) == 0: print(len(n)) elif len(n) == 0: print(len(m)) else: dp = [[0 for _ in range(len(n)+1)]...

2024-06-18

1 168

题解 | #最小花费爬楼梯#

while 1: try: n = int(input()) cost = list(map(int, input().split(' '))) dp = [0]*(n+1) for i in range(2, n+1): ...

2023-02-25

1 204

题解 | #跳台阶扩展问题#

while 1: try: n = int(input()) dp = [1]*(n+1) for i in range(2, n+1): dp[i] = sum(dp[:i]) print(dp[n])...

2023-02-24

1 247

题解 | #在字符串中找出连续最长的数字串#

# 滑动窗口 while 1: try: s = input() left = 0 right = 0 nums = [] while right < len(s): if righ...

2023-01-06

1 234

题解 | #走方格的方案数#

def Roadcount(n, m): if n == 1 and m == 1: return 2 elif n == 1 and m > 1: return 1+Roadcount(n, m-1) elif n > 1 and...

2023-01-03

1 201

题解 | #扑克牌大小#

def pk(a, b): cardorder = ['3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A', '2', 'joker', 'JOKER'] if len(a) == len(b): fo...

2022-12-29

1 267

题解 | #求最小公倍数#

def minmultiple(a, b): if a == b: return a if a == 1 or b == 1: return a*b k = 1 for i in range(2, a+1): if a%...

2022-12-29

1 236

题解 | #求最大连续bit数#

n = int(input()) b = bin(n) b = b[2:].split('0') print(max([len(i) for i in b]))

2022-12-28

1 207

题解 | #矩阵乘法#

a = int(input()) b = int(input()) c = int(input()) x = [[0]*b for _ in range(a)] y = [[0]*c for _ in range(b)] z = [[0]*c for _ in range(a)] for i in ...

2022-12-22

1 257

题解 | #成绩排序#

n = int(input()) value = int(input()) array = [[0]*n for _ in range(2)] for i in range(n): array[0][i], array[1][i] = input().split(' ') if value ...

2022-12-22

1 227