{"id":6857,"date":"2020-05-31T09:49:59","date_gmt":"2020-05-31T16:49:59","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=6857"},"modified":"2020-05-31T09:50:06","modified_gmt":"2020-05-31T16:50:06","slug":"leetcode-1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts"},"content":{"rendered":"\n

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

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

Example 1:<\/strong><\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]\nOutput:<\/strong> 4 \nExplanation:<\/strong> 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.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]\nOutput:<\/strong> 6\nExplanation:<\/strong> 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.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> h = 5, w = 4, horizontalCuts = [3], verticalCuts = [3]\nOutput:<\/strong> 9\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 2 <= h, w <= 10^9<\/code><\/li>
  • 1 <= horizontalCuts.length < min(h, 10^5)<\/code><\/li>
  • 1 <= verticalCuts.length < min(w, 10^5)<\/code><\/li>
  • 1 <= horizontalCuts[i] < h<\/code><\/li>
  • 1 <= verticalCuts[i] < w<\/code><\/li>
  • It is guaranteed that all elements in horizontalCuts<\/code> are distinct.<\/li>
  • It is guaranteed that all elements in verticalCuts<\/code> are distinct.<\/li><\/ul>\n\n\n\n
    Solution: Geometry<\/strong><\/h2>\n\n\n\n
    Find the max gap between vertical cuts mx and max gap between horizontal cuts my. ans = mx * my<\/p>\n\n\n\n
    Time complexity: O(nlogn)
    Space complexity: O(1) if sort in place otherweise O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int maxArea(int h, int w, vector& horizontalCuts, vector& verticalCuts) {\n    constexpr int kMod = 1e9 + 7;\n    sort(begin(verticalCuts), end(verticalCuts));\n    sort(begin(horizontalCuts), end(horizontalCuts));\n    int mx = max(verticalCuts[0], w - verticalCuts.back());\n    int my = max(horizontalCuts[0], h - horizontalCuts.back());\n    for (int i = 1; i < verticalCuts.size(); ++i)\n      mx = max(mx, verticalCuts[i] - verticalCuts[i - 1]);\n    for (int i = 1; i < horizontalCuts.size(); ++i)\n      my = max(my, horizontalCuts[i] - horizontalCuts[i - 1]);               \n    return static_cast(mx) * my % kMod;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[127],"tags":[613,284,177],"class_list":["post-6857","post","type-post","status-publish","format-standard","hentry","category-geometry","tag-diff","tag-geometry","tag-medium","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6857","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=6857"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6857\/revisions"}],"predecessor-version":[{"id":6859,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/6857\/revisions\/6859"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=6857"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=6857"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=6857"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}