LeetCode 筆記 - 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts

class Solution:
    def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:
        
        def get_max_space(size: int, cut: List[int]) -> int:
            cut.sort()
            
            last_index = 0
            result = 0
            for c in cut:
                if c == 0:
                    continue
                result = max(result, c - last_index)
                last_index = c
                
            result = max(result, size - last_index)
                
            return result
        
        max_h = get_max_space(h, horizontalCuts)
        max_w = get_max_space(w, verticalCuts)
        
        return (max_h * max_w) % (10 ** 9 + 7)