zoukankan      html  css  js  c++  java
  • 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (M)

    Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (M)

    题目

    Given a rectangular cake with height h and width w, and two arrays of integers horizontalCuts and verticalCuts where horizontalCuts[i] is the distance from the top of the rectangular cake to the ith horizontal cut and similarly, verticalCuts[j] is the distance from the left of the rectangular cake to the jth vertical cut.

    Return the maximum area of a piece of cake after you cut at each horizontal and vertical position provided in the arrays horizontalCuts and verticalCuts. Since the answer can be a huge number, return this modulo 10^9 + 7.

    Example 1:

    Input: h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
    Output: 4 
    Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green piece of cake has the maximum area.
    

    Example 2:

    Input: h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]
    Output: 6
    Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green and yellow pieces of cake have the maximum area.
    

    Example 3:

    Input: h = 5, w = 4, horizontalCuts = [3], verticalCuts = [3]
    Output: 9
    

    Constraints:

    • 2 <= h, w <= 10^9
    • 1 <= horizontalCuts.length < min(h, 10^5)
    • 1 <= verticalCuts.length < min(w, 10^5)
    • 1 <= horizontalCuts[i] < h
    • 1 <= verticalCuts[i] < w
    • It is guaranteed that all elements in horizontalCuts are distinct.
    • It is guaranteed that all elements in verticalCuts are distinct.

    题意

    在一个矩形上竖着和横着各切若干刀,求能得到的最大面积的小矩形。

    思路

    分别求出纵向和横向最大的间隔,相乘即是最大面积,注意越界。


    代码实现

    Java

    class Solution {
        public int maxArea(int h, int w, int[] horizontalCuts, int[] verticalCuts) {
            Arrays.sort(horizontalCuts);
            Arrays.sort(verticalCuts);
    
            int height = h - horizontalCuts[horizontalCuts.length - 1];
            int width = w - verticalCuts[verticalCuts.length - 1];
            int pre = 0;
    
            for (int num : horizontalCuts) {
                height = Math.max(height, num - pre);
                pre = num;
            }
            
            pre = 0;
            for (int num : verticalCuts) {
                width = Math.max(width, num - pre);
                pre = num;
            }
    
            return (int)((long) height * width % 1000000007);
        }
    }
    
  • 相关阅读:
    SpringBoot表单验证
    新创建的maven项目,显示的jdk版本与使用的不一致
    maven常用的构建命令
    maven 配置说明
    springmvc 初始化参数绑定(使用属性编辑器) 来处理类型转换问题
    【LOJ#10180】烽火传递 单调队列+dp
    【洛谷P1854】花店橱窗 线性dp+路径输出
    【CF1076D】Edge Deletion 最短路+贪心
    【洛谷P5020】货币系统 完全背包
    【洛谷P5018】对称二叉树
  • 原文地址:https://www.cnblogs.com/mapoos/p/14847505.html
Copyright © 2011-2022 走看看