leetcode-191周赛-1465-切割后面积最大的蛋糕
题目描述:
提价:
class Solution: def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int: horizontalCuts.sort() verticalCuts.sort() horizontalCuts = [0] + horizontalCuts + [h] verticalCuts = [0] + verticalCuts + [w] maxh ,maxw = 0 ,0 for i in range(1,len(horizontalCuts)): maxh = max(maxh,horizontalCuts[i] - horizontalCuts[i - 1]) for i in range(1,len(verticalCuts)): maxw = max(maxw,verticalCuts[i] - verticalCuts[i - 1]) return maxh * maxw % (10**9 + 7)