分类: 算法

3 篇文章

48. 旋转图像—leetcode
class Solution: def rotate(self, matrix: List[List[int]]) -> None: """ Do not return anything, modify matrix in-place instead. 难点:会覆盖还未移动的值 """ # n = len(matrix) # if …
蓝桥杯算法-分巧克力
import os import sys import math # 请在此输入您的代码 def process(N,K): all_num = 0 H = [] W = [] # 循环输入N块巧克力的形状 for _ in range(N): h, w = map(int, input().split()) H.append(h)…
蓝桥大使【算法赛】
py代码如下: import os import sys n = int(input()) # 初始化数组 A = [0] * n B = [0] * n C = [0] * n res = 0 for i in range(n): A[i], B[i] = map(int, input().split())…