<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:
    int maxPoints(vector<vector<int>>& points) {
        int n = points.size();
       if(n == 1) return 1;
        int cnt =0;
        for(int i=0; i<n; i++){
            unordered_map<double, set<pair<int,int>>> mp;
            double slope;
            // int size = 0;
            for(int j=0; j<n; j++){
                if(i == j) continue;
                double x = points[j][0]-points[i][0];
                double y = points[j][1]-points[i][1];
                slope = y/x;
                mp[slope].insert(make_pair(points[j][0],points[j][1]));
                mp[slope].insert(make_pair(points[i][0],points[i][1]));
                int size = mp[slope].size();
            // cout << slope << " " << size << endl;
            cnt = max(cnt, size);
            }
            int size = mp[slope].size();
            cout << slope << " " << size << endl;
            // cnt = max(cnt, size);
        }
        return cnt;
    }
};
49558