Leetcode Max Points on a line

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

[方法1]

/**
 * 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) {
        if(points==null || points.length==0)return 0;
        HashMap<Double, Integer> map=new HashMap<Double, Integer>();
        int max=0;
        for(int i=0;i<points.length;i++)
        {
            Point p=points[i];
            int duplicate=1, vertical=0;
            map.clear();
            for(int j=i+1;j<points.length;j++)
            {
                Point q=points[j];
                if(p.x==q.x && p.y==q.y)
                {
                    duplicate++;
                }
                else if(p.x==q.x)
                {
                    vertical++;
                }
                else
                {
                    double k=0.0+(double)(p.y-q.y)/(double)(p.x-q.x); //不加0.0会出现0.0!=-0.0的情况
                    if(map.containsKey(k)==false)map.put(k,1);
                    else map.put(k,map.get(k)+1);
                }
            }
            for(double key:map.keySet())
            {
                max=Math.max(max,map.get(key)+duplicate);
            }
            max=Math.max(max,vertical+duplicate);
        }
        return max;
    }
}

---

[方法2]

class Line {
    public double a, b, c;
    public Line(double a, double b, double c) {
        this.a = a;
        this.b = b;
        this.c = c;
    }

    public Line(int x1, int y1, int x2, int y2) {
        if (x1 == x2) {
            if (x1 == 0) {
                a = 1;
                b = 0;
                c = 0;
            } else {
                a = 1.0 / x1;
                b = 0;
                c = 1;
            }
        } else if (y1 == y2) {
            if (y1 == 0) {
                a = 0;
                b = 1;
                c = 0;
            } else {
                a = 0;
                b = 1.0 / y1;
                c = 1;
            }
        } else {
            if (x1 * y2 == x2 * y1) {
                a = 1;
                b = - 1.0 * (y1 - y2) / (x1 - x2);
                c = 0;
           } else {
                a = 1.0 * (y1 - y2) / (x2 * y1 - x1 * y2);
                b = 1.0 * (x1 - x2) / (x1 * y2 - x2 * y1);
                c = 1;
            }
        }
    }

    public String toString() {
        return Double.toString(a) + " " + Double.toString(b) + " " + Double.toString(c);
    }
}

public class Solution {

    public int maxPoints(Point[] points) {
        if (points.length < 2) {
            return points.length;
        }

        HashMap<String, Integer> hash = new HashMap<String, Integer>();
        for (int i = 0; i < points.length; i++) {
            for (int j = i + 1; j < points.length; j++) {
                Line line = new Line(points[i].x, points[i].y,
                                     points[j].x, points[j].y);
                String key = line.toString();
                if (hash.containsKey(key)) {
                    hash.put(key, hash.get(key) + 1);
                } else {
                    hash.put(key, 1);
                }
            }
        }

        int max = 0;
        String maxKey = "";
        for (String key: hash.keySet()) {
            if (hash.get(key) > max) {
                max = hash.get(key);
                maxKey = key;

            }
        }
        String[] params = maxKey.split(" ");
        double a = Double.parseDouble(params[0]);
        double b = Double.parseDouble(params[1]);
        double c = Double.parseDouble(params[2]);

        int count = 0;
        for (int i = 0; i < points.length; i++) {
            if (Math.abs(a * points[i].x + b * points[i].y - c) < 1e-6) {
                count++;
            }
        }
        return count;
    }
}