leetcode+在同一直线上最多的点数，map哈希，注意特殊情况

点击打开链接

struct Point {
    int x;
    int y;
    Point() : x(0), y(0) {}
    Point(int a, int b) : x(a), y(b) {}
};

class Solution {
public:
    int maxPoints(vector& points) {
        if(points.empty()) return 0;
        int res = 1;
        for(int i=0; i Map;
            int duplicates = 0, verticals = 1;
            for(int j=i+1; j