卡啦啦啦
卡啦啦啦
全部文章
分类
归档
标签
去牛客网
登录
/
注册
卡啦啦啦的博客
全部文章
(共45篇)
题解 | #求最大连续bit数#
n: int = int(input()) count: int = 0 max_count: int = 0 while n: if n % 2 == 0: count = 0 else: count += 1 if count &g...
2024-10-02
0
125
题解 | #最长回文子串#
# left-> <-right # 'abba' def isPalindrome(s): left = 0 right = len(s) - 1 while left < right: if s[left] != s[rig...
2024-10-02
0
93
题解 | #统计大写字母个数#
def count_big_chr(str: str) -> int: c: int = 0 for x in str: ord_x = ord(x) if 65 <= ord_x <= 90: c += 1 ...
2024-10-01
0
98
题解 | #字符串字符匹配#
def is_in_logstr(ss: str, ls: str): for i in ss: # print(i) if i not in ls: return "false" return "...
2024-10-01
0
73
题解 | #整型数组合并#
while True: try: len1: int = int(input()) list1: list = input().split(" ") len2: int = int(input()) list...
2024-10-01
0
92
题解 | #尼科彻斯定理#
# n * n * n = sum(连续n个奇数) = n * (首尾相加) / 2 # 中间数 = (首尾相加) / 2 = n * n # 首数 = n * n - n + 1 # 尾数 = n * n + n - 1 while True: try: n: int =...
2024-10-01
0
82
题解 | #计算日期到天数转换#
while True: try: s: list = input().split(" ") y: int = int(s[0]) m: int = int(s[1]) d: int = int(s[2]) ...
2024-10-01
0
76
题解 | #查找输入整数二进制中1的个数#
# print(bin(5)[2:].count('1')) # n:int = int(input()) # print(bin(n)[2:].count('1')) # # while True: # try: # n: int = int(input()) # ...
2024-10-01
0
74
题解 | #蛇形矩阵#
# 1 3 6 10 15 # 2 5 9 14 # 4 8 13 # 7 12 # 11 # 构造成上述这样的,最终打印时候只要前面空的不打印即可。 # 第一行,从第1列到第j列(j < n + 1) # f(1,2)-f(1,1)=2 # f...
2024-10-01
0
91
题解 | #查找组成一个偶数最接近的两个素数#
import math def is_prime(n: int): if 2<=n<=3: return True else: for i in range(2, int(math.sqrt(n)) + 1, 1): ...
2024-10-01
0
83
首页
上一页
1
2
3
4
5
下一页
末页