- 博客(4)
- 收藏
- 关注
RSS订阅原创 安置原料厂——python版
def msd(nums, count): def mdOne(left, right): mid = (left + right) // 2 distance = 0 for i in range(left, right + 1): distance += abs(nums[i] - nums[mid]) return distance def psf(n, count): .
2020-09-09 01:30:17
114
原创 实现Max-Pooling——python版
from collections import dequedef func(nums, k, stride): queue = deque() res = [] n = len(nums) step = 0 first = 1 for i in range(n): step += 1 if queue and i - queue[0] + 1 > k: queue.popleft() .
2020-09-09 01:28:11
1540
原创 归并排序和快速排序—python版
归并排序def merge_sort(nums): if len(nums) <= 1: return nums mid = len(nums)//2 left = merge_sort(nums[:mid]) right = merge_sort(nums[mid:]) return merge(left, right)...
2020-09-09 01:25:43
117
原创 快速幂取模及数学证明——python版
问题：计算x的n次幂，该结果对Mod进行取模（由于该结果的值可能会很大）。def func(x, n, Mod): res = 1 while n != 0: if n & 1: res = (res * x) % Mod n >>= 1 x = (x * x) % Mod ...
2020-03-15 20:55:31
1020
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人