# Leetcode: Max Points on a Line

17949人阅读 评论(9)

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

y = ax + b

y1 = kx1 +b

y2 = kx2 +b

/**
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
unordered_map<float,int> mp;
int maxNum = 0;
for(int i = 0; i < points.size(); i++)
{
mp.clear();
mp[INT_MIN] = 0;
int duplicate = 1;
for(int j = 0; j < points.size(); j++)
{
if(j == i) continue;
if(points[i].x == points[j].x && points[i].y == points[j].y)
{
duplicate++;
continue;
}
float k = points[i].x == points[j].x ? INT_MAX : (float)(points[j].y - points[i].y)/(points[j].x - points[i].x);
mp[k]++;
}
unordered_map<float, int>::iterator it = mp.begin();
for(; it != mp.end(); it++)
if(it->second + duplicate > maxNum)
maxNum = it->second + duplicate;
}
return maxNum;
}
};

0、points中重复出现的点。

1、int maxNum = 0;

2、mp[INT_MIN] = 0;

3、int duplicate = 1;

duplicate记录重复点的数量，初始化为1，是因为要把当前的点points[i]加进去。

4、float k = points[i].x == points[j].x ? INT_MAX : (float)(points[j].y - points[i].y)/(points[j].x - points[i].x);

4
1

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：1051274次
• 积分：12486
• 等级：
• 排名：第1118名
• 原创：268篇
• 转载：59篇
• 译文：4篇
• 评论：325条
我是博主
阅读排行
最新评论