To define a line: a point and the slope;
Key point: define the slope as double, and multiplex 10000, like k=10000*(points[i].y-points[j].y) / (points[i].x-points[j].x);
/**
* Definition for a point.
* 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<Point> &points) {
if (points.size()<=2) return points.size();
int res=0;
for (int i=0; i<points.size(); i++)
{
int cur=0, same=0;
unordered_map<double, int> map;
for (int j=i+1; j<points.size(); j++) {
if (i!=j) {
if (points[i].x==points[j].x && (points[i].y==points[j].y)) {
same++;
continue;
}
double k=std::numeric_limits<double>::infinity();
if (points[i].x!=points[j].x) {
k=10000*(points[i].y-points[j].y) / (points[i].x-points[j].x);
}
if (map.find(k)==map.end()) {
map.insert(unordered_map<double, int>::value_type{k,1});
}else{
map[k]++;
}
if (map[k]>cur) {
cur = map[k];
}
}
}
cur = cur + same +1;
if (cur > res) {
res = cur;
}
}
return res;
}
};