<p>Given an array of <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents a point on the <strong>X-Y</strong> plane, return <em>the maximum number of points that lie on the same straight line</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[2,2],[3,3]]
<strong>Output:</strong> 3
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 300</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>-10<sup>4</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>4</sup></code></li>
	<li>All the <code>points</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    double get_slope(vector<int> point1, vector<int>point2) {
        if (point1[0] == point2[0])
            return INT_MAX;
        return (point1[1] * 1.0 - point2[1] * 1.0) / (point1[0] * 1.0 - point2[0] * 1.0); 
    }
    double get_intercept(vector<int> point1, double slope) {
        return point1[1] - slope * point1[0];
    }
    int maxPoints(vector<vector<int>>& points) {
        int max_points = 1;
        unordered_map <double, unordered_map<double, set<int>>> lines;
        for (int i = 0; i < points.size(); i++) {
            for (int j = i + 1; j < points.size(); j++) {
                double slope = get_slope(points[i], points[j]);
                double intercept = get_intercept(points[i], slope);

                if (lines.find(slope) == lines.end()) {
                    set <int> temp_set;
                    unordered_map<double, set<int>> temp;
                    temp[intercept] = temp_set;
                    lines[slope] = temp;
                }
                else {
                    if (lines[slope].find(intercept) == lines[slope].end()) {
                        set <int> temp_set;
                        lines[slope][intercept] = temp_set;
                    }
                }
                lines[slope][intercept].insert(i);
                lines[slope][intercept].insert(j);
                int size = lines[slope][intercept].size();

                cout << slope << " " << intercept << " " << size << endl;
                max_points = max(max_points, size);
            }
        }
        return max_points;
    }
};
65553