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.

</pre><pre name="code" class="java">/**
 * 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 maxValue=0;
        /*for(int i=0;i<points.length-1;i++)*/
        for (int i=0; i<(points.length-maxValue); i++){
            Map<Double,Integer> map=new HashMap<Double,Integer>();
            int same=0;
            for(int j=i+1;j<points.length;j++){
                double slop=0.0;
                if(points[i].x==points[j].x && points[j].y==points[i].y){
                    same++;
                    continue;
                }
                else if(points[i].x==points[j].x){
                    slop=Double.MAX_VALUE;
                }
                else if(points[i].y==points[j].y){
                    slop=0;
                }
                else{
                    slop=new Double((double) (points[i].y-points[j].y) / (points[i].x-points[j].x) );
                }
                if(!map.containsKey(slop)) map.put(slop,1);
                else map.put(slop,map.get(slop)+1);
            }
            maxValue=Math.max(maxValue,1+same+maxValue(map) );
        }
        
        
        return maxValue;
    }
    public int maxValue(Map<Double,Integer> map){
        int max=0;
        Iterator it=map.keySet().iterator();
        while(it.hasNext()){
            max=Math.max(max ,map.get(it.next()) );
        }
        return max;
    }
}

思路：这个代码存在很多不严谨之处。