1
class Solution {
2
 public:
3
  int maxWidthOfVerticalArea(vector<vector<int>> &points) {
4
    sort(begin(points), end(points));
5
    int n = points.size();
6
    int m = 0;
7
    for (int i = 0; i < n - 1; i++) m = max(points[i + 1][0] - points[i][0], m);
8
    return m;
9
  }
10
};