(leetcode 2) 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.

/**
 * Definition for a point.
 * struct Point {
 *     int x;
 *     int y;
 *     Point() : x(0), y(0) {}
 *     Point(int a, int b) : x(a), y(b) {}
 * };
 * 
 * 从i(1-n)点开始计算0-n的点与i的斜率，如果与i的斜率相等，则必定在一条直线上，不过要多判断几种情况，如垂直，重复点
 */
class Solution {
public:
    int maxPoints(vector<Point> &points) {
        int size = points.size(), max = 0;
        if(1 == size) return 1;
        for(int i = 0 ; i < size ; i++)
        {
            map<double, int> mp;
            int samePoint = 0 , maxTmp = 0;
            double xieLv = 0; 
            for(int j = 0 ; j < size ; j++)
            {
                if(i == j) continue;
                if(points[i].x==points[j].x && points[i].y==points[j].y)
                 {
                    samePoint++;
                    continue;
                 }
                       
                if((points[j].x-points[i].x)==0) //垂直情况
                {
                    xieLv = INT_MAX;
                    mp[xieLv]++;
                }
                else{
                     xieLv =(double)(points[j].y-points[i].y)/(points[j].x-points[i].x); //之前忘加（double）导致计算精度错误。。。
                     mp[xieLv]++;
                }
                if(mp[xieLv] > maxTmp)
                    maxTmp = mp[xieLv];
            }
            if((maxTmp+samePoint+1) > max)
                max = maxTmp+samePoint+1;
        }
        return max;
    }
};