第一题:项目分配的问题。n,m= 3,3 nums = [[1,3,3],[2,2,2],[3,2,1]] new_nums = [[] for i in range(m)] for i in range(n): for j in range(m): new_nums[j].append(nums[i][j]) max_ = 0 for i in range(m): max_ += max(new_nums[i]) print(max_) 第二题:正多变形的问题n = 6 nums = [1,-2,3,5,6,2] res = [] # 子阵的长度是原始...