labmem012的博客

Decorators-Primer on Python Decorators 装饰器入门

labmem012 — Tue, 23 Apr 2024 00:43:14 +0800

Decorators-Primer on Python Decorators 装饰器入门

NetLogo ：child process exited with code 1解决方案

labmem012 — Thu, 19 Jan 2023 15:57:02 +0800

NetLogo ：child process exited with code 1 解决方案

TypeError: ‘float‘ object is not subscriptable 原因

labmem012 — Fri, 23 Dec 2022 17:31:18 +0800

TypeError: 'float' object is not subscriptable 原因

蓝桥杯 ALGO-30 入学考试 python 题解

labmem012 — Mon, 27 Dec 2021 23:30:18 +0800

经典背包问题 T, M = map(int, input().split()) dp = [[0 for i in range(T+1)] for j in range(M+1)] t = [] v = [] for i in range(0, M): a, b = map(int, input().split()) t.append(a) v.append(b) for i in range(0, M): for j in range(0, T+1): if j < t[i]: .

蓝桥杯ALGO-986 藏匿的刺客 python题解

labmem012 — Mon, 27 Dec 2021 17:59:25 +0800

贪心算法用嵌套列表储存数据先按ri排序（升序），取最小的r0为minr，在s（列表）中添加minr，删除list中包含minr的数据段，然后循环再取新的minr，再删，一直删到list中没有元素。然后s的长度就是所求的最小值。代码如下 n = int(input()) list = [] for i in range(0, n): l, r = map(int, input().split()) list.append([l, r]) list.sort(key=lambda