leetcode-149-直线上最多的点数

//使用除法会有精度问题，借用最大公约数（辗转相除）构造pair代替斜率k

class Solution {
public:
    int gcd(int x, int y) {
        return y == 0 ? x : gcd(y, x%y);
    }
    int maxPoints(vector<vector<int>>& points) {
        if (points.size() == 0 || points.size() == 1) return points.size();
        pair<int, int> k;
        int res = 0, N = points.size(), i, j, k_gcd;
        map<vector<int>, int> freq;
        for (i = 0; i < N; i++) {
            freq[points[i]]++;
        }
        vector<map<pair<int, int>, int>> count(points.size());
        for (int i = 0; i < points.size()-1; i++) {
            res = max(res,freq[points[i]]);
            for (int j = i+1; j < points.size(); j++) {
                if (points[j] == points[i]) continue;
                k_gcd = gcd(points[i][1] - points[j][1], points[i][0] - points[j][0]);
                k = make_pair((points[i][1] - points[j][1])/k_gcd, (points[i][0] - points[j][0])/k_gcd);
                //k = double(points[i][1] - points[j][1]) / (points[i][0] - points[j][0]);
                if (count[i].find(k) == count[i].end()) { //不存在
                    count[i].insert(make_pair(k, freq[points[i]]));
                }
                if (count[j].find(k) == count[j].end()) {
                    count[j].insert(make_pair(k, freq[points[j]]));
                }
                count[i][k]++;
                count[j][k]++;
                res = max(max(count[i][k], count[j][k]), res);
            }
        }
        return res;
    }
};

int main()
{
    Solution sol;
    vector<vector<int>> points = { {-54,-297},{-36,-222},{3,-2},{30,53},{-5,1},{-36,-222},{0,2},{1,3},{6,-47},{0,4},{2,3},{5,0},{48,128},{24,28},{0,-5},{48,128},{-12,-122},{-54,-297},{-42,-247},{-5,0},{2,4},{0,0},{54,153},{-30,-197},{4,5},{4,3},{-42,-247},{6,-47},{-60,-322},{-4,-2},{-18,-147},{6,-47},{60,178},{30,53},{-5,3},{-42,-247},{2,-2},{12,-22},{24,28},{0,-72},{3,-4},{-60,-322},{48,128},{0,-72},{-5,3},{5,5},{-24,-172},{-48,-272},{36,78},{-3,3} };
    //vector<vector<int>> points = {{0,0}, {94911151,94911150}, {94911152,94911151}};
    //vector<vector<int>> points = { {1,1}, {2,2}, {3,3} };
    cout << sol.maxPoints(points);
    cout<< endl;
    return 0;
}