{"id":7582,"date":"2020-10-31T13:29:59","date_gmt":"2020-10-31T20:29:59","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7582"},"modified":"2020-10-31T13:30:51","modified_gmt":"2020-10-31T20:30:51","slug":"leetcode-1637-widest-vertical-area-between-two-points-containing-no-points","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-1637-widest-vertical-area-between-two-points-containing-no-points\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1637. Widest Vertical Area Between Two Points Containing No Points"},"content":{"rendered":"\n

Given n<\/code> points<\/code> on a 2D plane where points[i] = [xi<\/sub>, yi<\/sub>]<\/code>, Return the widest vertical area<\/strong> between two points such that no points are inside the area.<\/em><\/p>\n\n\n\n

A vertical area<\/strong> is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area<\/strong> is the one with the maximum width.<\/p>\n\n\n\n

Note that points on the edge<\/strong> of a vertical area are not<\/strong> considered included in the area.<\/p>\n\n\n\n

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

\"\"\/<\/figure>\n\n\n\n

\u200b<\/p>\n\n\n\n

Input:<\/strong> points = [[8,7],[9,9],[7,4],[9,7]]\nOutput:<\/strong> 1\nExplanation:<\/strong> Both the red and the blue area are optimal.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]\nOutput:<\/strong> 3\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • n == points.length<\/code><\/li>
  • 2 <= n <= 105<\/sup><\/code><\/li>
  • points[i].length == 2<\/code><\/li>
  • 0 <= xi<\/sub>, yi<\/sub> <= 109<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Sort by x coordinates<\/strong><\/h2>\n\n\n\n
    Time complexity: O(nlogn)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \nclass Solution {\npublic:\n  int maxWidthOfVerticalArea(vector>& points) {\n    sort(begin(points), end(points), [](const auto& p1, const auto& p2) {\n      return p1[0] != p2[0] ? p1[0] < p2[0] : p1[1] < p2[1];\n    });\n    int ans = 0;\n    for (int i = 1; i < points.size(); ++i)\n      ans = max(ans, points[i][0] - points[i - 1][0]);\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area. A vertical area is an area…<\/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":[284,177,23],"class_list":["post-7582","post","type-post","status-publish","format-standard","hentry","category-geometry","tag-geometry","tag-medium","tag-sort","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7582","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=7582"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7582\/revisions"}],"predecessor-version":[{"id":7584,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7582\/revisions\/7584"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7582"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7582"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7582"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}