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

关键点是 重合点 和 斜率不存在的点（斜率不存在的点完全可以利用乘法弥补）也就是交叉相乘法。

 

/**
 * Definition for a point.
 * class Point {
 *     int x;
 *     int y;
 *     Point() { x = 0; y = 0; }
 *     Point(int a, int b) { x = a; y = b; }
 * }
 */

public class Solution {
    public int maxPoints(Point[] points) {
        int ABx;
        int ABy;
        int BCx;
        int BCy;
        
        if(points.length<=2) return points.length;
        int max=2;//用来记录最大个数
        
        for(int i=0;i<points.length;i++){
            int num=0;//重合点数
            int temp=1;//同一直线点数
    
            for(int j=i+1;j<points.length;j++){
                ABx=points[i].x-points[j].x;
                ABy=points[i].y-points[j].y;
                if(ABx==0 && ABy==0)
                {
                    num++;
                }else{
                    temp++;
                    for(int k=j+1;k<points.length;k++){
                        BCx=points[j].x-points[k].x;
                        BCy=points[j].y-points[k].y;
                        if(ABx*BCy==BCx*ABy){//表示两个斜率相等，转化为乘积的形式可以避免分母为0的情况
                            temp++;
                        }
                    }
                }
                if(max<(num+temp)){
                  max=num+temp;
                }
                temp=1;
            }
                            
        }
        return max;
    }
}