[LeetCode] Max Points on a Line

Build a map for each point to count each different slope will pass how many points.

NOTE: There are duplicate points!!!

/**
 * Definition for a point.
 * struct Point {
 *     int x;
 *     int y;
 *     Point() : x(0), y(0) {}
 *     Point(int a, int b) : x(a), y(b) {}
 * };
 */
class Solution {
public:
    int maxPoints(vector<Point> &points) {

        //Num of points passed by the line originating from point i，float as slope
		unordered_map<float,int> lines;
		int maxNum = 0;
		for(int i = 0; i < points.size(); i++) {
		    //Reset for each originating point
			lines.clear();
			lines[INT_MIN] = 0;
			int duplicate = 1;
			for(int j = 0; j < points.size(); j++) {
				if(j == i) continue;
				if(points[i].x == points[j].x && points[i].y == points[j].y) //Handle duplicate points
				{
					duplicate++;
					continue;
				}
				float k = points[i].x == points[j].x ? INT_MAX : (float)(points[j].y - points[i].y)/(points[j].x - points[i].x);
				lines[k]++;
			}
			
			for(unordered_map<float, int>::iterator it = lines.begin(); it != lines.end(); it++)
				if(it->second + duplicate > maxNum)
					maxNum = it->second + duplicate;
		}
		return maxNum;
    }
};