牛客err

分类

题解(4)

/ 注册

TA的专栏 20篇文章 0人订阅

数据结构练习

20篇文章 132人学习

全部文章（共162篇）

题解 | #名字的漂亮度#

n = int(input()) def func(str1): key = set(list(str1)) # 去重 dic = {} for i in key: dic[i] = str1.count(i) # 生成一个字典，键是字母，值是字符串里...

2024-08-14

0 95

题解 | #迷宫问题#

m, n = list(map(int,input().split())) # m行n列 maze = [list(input().split()) for _ in range(m)] # 不能是int,因为后面对比的是字符 # print(m,n) # print(maze) def ...

2024-08-14

0 111

题解 | #称砝码#

n = int(input()) weights = list(map(int, input().split())) nums = list(map(int ,input().split())) res = {0,} all = [] for i in range(n): for ...

2024-08-14

1 106

题解 | #求小球落地5次后所经历的路程和第5次反弹的高度#

height = int(input()) sum = 0 for i in range(5): sum += 3/2*height # 每次从一个高度落下在回弹的路径长度 height = 1/2*height # 下次下落的高度 print(f"{sum - ...

2024-08-14

0 85

题解 | #字符串加密#

keys = input() str1 = input() s_tmp = set([]) keys_tmp = keys keys = [] for i in keys_tmp: # 对密钥去重 if i not in s_tmp: keys.append(i) ...

2024-08-13

0 129

题解 | #整数与IP地址间的转换#

stri = input().split('.') n1 = bin(int(stri[0]))[2:] n2 = bin(int(stri[1]))[2:] n3 = bin(int(stri[2]))[2:] n4 = bin(int(stri[3]))[2:] # 转换成二进制 def ...

2024-08-13

0 98

题解 | #字符串加解密#

digi = {} zimu = {} k = ['0','1','2','3','4','5','6','7','8','9'] v = ['1','2','3','4','5','6','7','8','9','0'] digi = dict(zip(k,v)) # print(digi) ...

2024-08-13

0 98

题解 | #查找兄弟单词#

inpt = input().split() n = int(inpt[0]) danci = inpt[1:n+1] x = inpt[-2] k = int(inpt[-1]) brothers = [] for i in danci: if i != x and sorted...

2024-08-13

0 115

题解 | #字符串排序#

stri = input() alpa = [i for i in stri if i.isalpha()] # 筛选字符 alpa = sorted(alpa,key=str.upper) # 将字符按照不区分大小进行排序 index = 0 for i in stri: if i....

2024-08-13

0 121

题解 | #合唱队#

n = int(input()) height = list(map(int,input().split())) def cacu_left(h): dp = [1]*n # dp[i]指的是第i个人左边符合合唱队的人 for i in range(len(h)): ...

2024-08-13

0 113