leetcode

0 class Solution {

1 public:

2 int maxWidthOfVerticalArea(const vector<vector<int>> &points) {

3 vector<int> v;

4 v.reserve(points.size());

5 for (int i = 0; i < points.size(); i++)

6 v.push_back(points[i][0]);

7 sort(v.begin(), v.end());

8

9 int maxi = 0;

10 for (int k = 1; k < v.size(); k++)

11 maxi = max(maxi, v[k] - v[k - 1]);

12 return maxi;

13 }

14 };