<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>>& arr) {
        int n = arr.size();
        if(n == 1) return 1;
        map<vector<double>, unordered_map<int, int>> mp;
        unordered_map<double, unordered_map<int, int>> mpx, mpy;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                double yd = arr[j][1] - arr[i][1];
                double xd = arr[j][0] - arr[i][0];
                if(yd == 0 || xd == 0){
                    if(yd == 0){
                        mpy[arr[i][1]][i]++;
                        mpy[arr[i][1]][j]++;
                    }
                    else{
                        mpx[arr[i][0]][i]++;
                        mpx[arr[i][0]][j]++;
                    }
                    continue;
                }
                double ok = 1;
                double xc = arr[i][0] - (arr[i][1]*xd)/yd;
                if((yd > 0 && xd < 0) || (yd < 0 && xd > 0)) ok = 0;
                yd = abs(yd);
                xd = abs(xd);
                double gd = __gcd((int)xd, (int)yd);
                yd /= gd;
                xd /= gd;
                mp[{yd, xd, xc, ok}][i]++;
                mp[{yd, xd, xc, ok}][j]++;
                cout << mp[{yd, xd, ok}].size() << endl;
            }
        }
        int ans = 0;
        for(auto it : mpx){
            ans = max(ans, (int)it.second.size());
        }
        for(auto it : mpy){
            ans = max(ans, (int)it.second.size());
        }
        for (auto it : mp) {
            ans = max(ans, (int)it.second.size());
        }
        return ans;
    }
};
86118