牛客825869540号

题解

/ 注册

全部文章 / 题解（共7篇）

题解 | #购物单#

def com_qikuang(N,price,inpot,my_fujian): r = [] for i in range(N): if my_fujian[i] == []: r.append([[price[i], price[i]*i...

2021-07-18

0 428

题解 | #数组分组#

# 只用考虑一个数组，是否能够达到和的一半 def dfs(left,mid,target): if sum(left) == target: return True if len(mid) == 0: return False ...

2021-07-18

0 758

题解 | #将真分数分解为埃及分数#

import math def fenjie(n): r = [1] for i in range(2,int(n//2)+1): if n%i == 0: r.append(i) return r def beibao(pocket...

2021-07-18

0 602

题解 | #公共子串计算#

# 动态规划以 dp[i][j]: 分别以i,j为结尾的最大子串的长度 s1,s2 = input(),input() n1,n2 = len(s1),len(s2) dp = [[0]*n2 for i in range(n1)] for i in range(n1): for j in...

2021-07-17

0 566

题解 | #字符串通配符#

# 用动态规划 # dp[i][j] 表示 s1[0:i+1],s2[0:j+1] 是否匹配 # s1[i]!=s2[j]: False # s1[i] == '?': 看 dp[i-1][j-1] # s1[i] == '*': 看所有的dp[i-1][0:j+1] 有 True 就是 True ...

2021-07-17

1 633

题解 | #DNA序列#

Python3: 栈 while True: try: n,dic,stk,num = int(input()),{},[],0 for i in range(n): key = chr(ord('A')+i) ...

2021-07-17

9 886

题解 | #Sudoku#

def myprint(matrix): for i in range(9): print(" ".join(list(map(str,matrix[i])))) def find_zeros(matrix): result = [] f...

2021-07-16

1 743