LeetCode 솔루션

[7/2] 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts

mingki 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.07.01 18:41

6,773 조회
1 댓글
0 추천
0 비추천
목록 게시글 쓰기

1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts

Medium

1145243Add to ListShare

You are given a rectangular cake of size h x 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, and
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 large number, return this modulo 109 + 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 <= 109
1 <= horizontalCuts.length <= min(h - 1, 105)
1 <= verticalCuts.length <= min(w - 1, 105)
1 <= horizontalCuts[i] < h
1 <= verticalCuts[i] < w
All the elements in horizontalCuts are distinct.
All the elements in verticalCuts are distinct.

#Expedia, #Goldman Sachs, #Array, #Greedy, #Sorting

링크

https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/ 2108 회 연결

익명
작성일 2022.07.02 01:43

class Solution {
public:
    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {
        int MOD = 1000000000 + 7;
        
        hc.push_back(h);
        vc.push_back(w);
        
        sort(hc.begin(), hc.end());
        sort(vc.begin(), vc.end());
        
        int hcsize = hc.size();
        int vcsize = vc.size();
        
        int hdiff = hcsize > 0 ? hc[0] : h;
        int wdiff = vcsize > 0 ? vc[0] : w;
        
        for (int i = 1; i < hcsize; ++i) {
            hdiff = max(hdiff, hc[i] - hc[i - 1]);
        }
        for (int i = 1; i < vcsize; ++i) {
            wdiff = max(wdiff, vc[i] - vc[i - 1]);
        }
        
        return ((long)hdiff * (long)wdiff) % MOD;
    }
};

C++
Runtime: 89 ms, faster than 74.55% of C++ online submissions for Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.
Memory Usage: 32.4 MB, less than 40.04% of C++ online submissions for Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.
[code=C++]class Solution {
public:
    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {
        int MOD = 1000000000 + 7;
        
        hc.push_back(h);
        vc.push_back(w);
        
        sort(hc.begin(), hc.end());
        sort(vc.begin(), vc.end());
        
        int hcsize = hc.size();
        int vcsize = vc.size();
        
        int hdiff = hcsize > 0 ? hc[0] : h;
        int wdiff = vcsize > 0 ? vc[0] : w;
        
        for (int i = 1; i < hcsize; ++i) {
            hdiff = max(hdiff, hc[i] - hc[i - 1]);
        }
        for (int i = 1; i < vcsize; ++i) {
            wdiff = max(wdiff, vc[i] - vc[i - 1]);
        }
        
        return ((long)hdiff * (long)wdiff) % MOD;
    }
};[/code]