【LintCode】最多有多少个点在一条直线上

给出二维平面上的n个点，求最多有多少点在同一条直线上。

样例
给出4个点：(1, 2), (3, 6), (0, 0), (1, 3)。
一条直线上的点最多有3个。

/**
 * 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 {
    /**
     * @param points an array of point
     * @return an integer
     */
        public int maxPoints(Point[] points) {
        if(null == points || points.length == 0) return 0;
        int max = 1;
        for(int i = 0; i < points.length; i++) {
            Point temp = points[i];//基点
            Map<Double, Integer> k_num = new HashMap<Double, Integer>();//斜率及与基点构成直线为该斜率的点的个数（包含基点）
            double k = 0.0;
            int tempmax = 1;
            int coincideNum = 0;//记录与基点重合的点的个数
            for(int j = i + 1; j < points.length; j++) {
                if(points[j].x - points[i].x == 0 && points[j].y - points[i].y == 0){//与基点重合
                    coincideNum++;
                    continue;
                }else if(points[j].x - points[i].x != 0) {//直线与y轴平行
                    k = (double)(points[j].y - points[i].y)/(double)(points[j].x - points[i].x);
                }else{
                    k = Double.MIN_VALUE;
                }
                int num = 2;
                if(k_num.containsKey(k)) {
                    num = k_num.get(k);
                    k_num.put(k, ++num);
                }else{
                    k_num.put(k, num);
                }
                tempmax = Math.max(tempmax, num);
            }
            max = Math.max(tempmax + coincideNum, max);
        }
        return max;
    }
}

//注意考虑特殊情况