自己试着写了下，感觉应该没什么问题 def meanFilter(nums, k): assert k % 2 == 1 n = k // 2 def mean(i): sum, count = 0, 0 for j in range(i-n, i+n+1): if 0 <= j < len(nums): sum += nums[j] count += 1 return sum / count return [mean(i) for i in range(len(nums))] def minPath(matrix): m, n = len(matrix), len(matrix[0]) def moveFrom(i, j): if i == m: return 0 else: left = float('inf') if j-1 < 0 else moveFrom(i+1, j-1) middle = moveFrom(i+1, j) right = float('inf') if j+1 > n-1 else moveFrom(i+1, j+1) return matrix[i][j] + min(middle, min(left, right)) res = min([moveFrom(0, j) for j in range(n)]) return res