Hanhahahahah的博客

美团笔试准备3.20牛客淘汰分数正则序列最优二叉树IILeetCode牛客淘汰分数题目描述a = list(map(int, input().split()))nums = list(map(int, input().split()))n = a[0] # 人数x = a[1] # 区间下限y = a[2] # 区间上限nums.sort()stack = []for i in range(n): stack.append(nums[i])

华为3.17笔试准备汇总LeetCode306数独牛客字符串分隔质数因子合并两个字典提取不重复整数识别有效IP地址和掩码并进行分类统计LeetCode306数独https://blog.youkuaiyun.com/quekai01/article/details/82710184牛客字符串分隔连续输入，长度不足8补0，超过8拆分输入：abc123456789输出：abc000001234567890000000while True: try: s = input()