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);
        }
    }
    
  • 相关阅读:
    SVN库迁移整理方法----官方推荐方式
    SVN跨版本库迁移目录并保留提交日志
    微信公众号 发送图文消息
    Egret白鹭开发微信小游戏排行榜功能
    双滑动列表实现
    unity之资深工程师
    unity之高级工程师
    lua踩坑系列之浅拷贝与深拷贝
    lua之table.remove你不知道的坑
    unity之Layout Group居中显示
  • 原文地址:https://www.cnblogs.com/mapoos/p/14847505.html
Copyright © 2011-2022 走看看