2023-12-21 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge
|

Today I have done leetcode's December LeetCoding Challenge with cpp.

December LeetCoding Challenge 21

Description

Widest Vertical Area Between Two Points Containing No Points

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 of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width.

Note that points on the edge of a vertical area are not considered included in the area.

 

Example 1:

​ 
Input: points = [[8,7],[9,9],[7,4],[9,7]]
Output: 1
Explanation: Both the red and the blue area are optimal.

Example 2:

Input: points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]
Output: 3

 

Constraints:

  • n == points.length
  • 2 <= n <= 105
  • points[i].length == 2
  • 0 <= xi, yi <= 109

Solution

auto speedup = [](){
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  return 0;
}();
class Solution {
public:
  int maxWidthOfVerticalArea(vector<vector<int>>& points) {
    sort(points.begin(), points.end());
    int answer = 0;
    for(int i = 1; i < points.size(); ++i) {
      answer = max(answer, points[i][0] - points[i - 1][0]);
    }
    return answer;
  }
};

// Accepted
// 55/55 cases passed (213 ms)
// Your runtime beats 74.84 % of cpp submissions
// Your memory usage beats 99.84 % of cpp submissions (64.8 MB)
Algorithm