/**
* 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() < 3) return points.size();
int temp = 0;
int maximum = 0;
for(int i=0;i<points.size()-1;++i)
{
for(int j=i+1;j<points.size();j++)
{
int a,b;
int sign=0;
temp = 0;
if (points[i].x == points[j].x) sign = 1;
else
{
a=points[i].x-points[j].x;
b=points[i].y-points[j].y;
}
for(int k=0;k<points.size();k++)
{
if(0==sign&&(a*(points[i].y-points[k].y))==(b*(points[i].x-points[k].x))||(sign==1&&points[k].x==points[i].x))
{
temp++;
}//if
}//for k
if(temp>maximum)
maximum=temp;
}
}
return maximum;
}
};
* 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() < 3) return points.size();
int temp = 0;
int maximum = 0;
for(int i=0;i<points.size()-1;++i)
{
for(int j=i+1;j<points.size();j++)
{
int a,b;
int sign=0;
temp = 0;
if (points[i].x == points[j].x) sign = 1;
else
{
a=points[i].x-points[j].x;
b=points[i].y-points[j].y;
}
for(int k=0;k<points.size();k++)
{
if(0==sign&&(a*(points[i].y-points[k].y))==(b*(points[i].x-points[k].x))||(sign==1&&points[k].x==points[i].x))
{
temp++;
}//if
}//for k
if(temp>maximum)
maximum=temp;
}
}
return maximum;
}
};