牛客err

分类

题解(4)

/ 注册

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

数据结构练习

20篇文章 132人学习

全部文章（共162篇）

题解 | #记票统计#

n = int(input()) names = input().split() voters = input() piao = input().split() zeros = [0 for i in range(n + 1)] s = dict(zip(names + ['Invalid']...

2024-08-09

1 111

题解 | #整型数组合并#

s =set([]) n = int(input()) nums1 = list(map(int, input().split())) n = int(input()) nums2 = list(map(int, input().split())) nums = nums1 + nums2...

2024-08-09

1 116

题解 | #记负均正II#

from math import e try: sum = 0 counter = 0 counter1 = 0 while True: n = int(input()) if n < 0: counter...

2024-08-09

1 114

题解 | #表示数字#

stri = input() for i in range(len(stri)): c = stri[i] if not c.isdigit(): # 不是数字直接打印 print(c,end='') else: # 当前字符是字符就分别讨论 ...

2024-08-09

1 115

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

n = int(input()) list1 = list(bin(n)[2:]) # 转换成二进制字符串0b开头，oct()八进制0o开头，hex()十六进制 0x开头 length = len(list1) def islianxu(s): for i in s: ...

2024-08-09

1 115

题解 | #最长回文子串#

stri = list(input()) def ishuiwen(li): # 判断是否是回文字符串 tmp = list(li) tmp.reverse() return li == tmp len1 = len(stri) max = 1 for i in r...

2024-08-09

1 110

题解 | #百钱买百鸡问题#

n = input() print("0 25 75") print("4 18 78") print("8 11 81") print("12 4 84")

2024-08-09

1 90

题解 | #输出单向链表中倒数第k个结点#

def func(): n = int(input()) nums = list(map(int, input().split())) k = int(input()) print(nums[-k]) # 倒数第k个,是负数 try: while Tr...

2024-08-09

1 112

题解 | #统计大写字母个数#

stri = input() counter = 0 for i in stri: if 'A' <= i <= 'Z': # python 可以直接链式比较，即中间不需要and，要注意<和>的方向 counter += 1 print(coun...

2024-08-09

0 113

题解 | #求最小公倍数#

a, b = list(map(int, input().split())) max = a if a > b else b min = a if a < b else b for i in range(min, 0, -1): if max % i == 0 and min...

2024-08-09

0 110