解题思路:
(1)按照横坐标排序,依次计算相邻横坐标的差
class Solution {
public:
int maxWidthOfVerticalArea(vector<vector<int>>& points) {
auto comp = [&](vector<int> &a, vector<int> &b) {
if(a[0]<b[0]) return true;
else return false;
};
sort(points.begin(),points.end(),comp);
int max = 0;
for(int i=0;i<points.size()-1;i++) {
if(points[i+1][0]-points[i][0]>max) max = points[i+1][0]-points[i][0];
}
return max;
}
};