<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:
    def maxPoints(self, points: List[List[int]]) -> int:
        d={}
        for i in range(len(points)):
            for j in points[i+1:]:
                xd=points[i][0]-j[0]
                yd=points[i][1]-j[1]
                if not xd:
                    slope="inf"
                    c=j[0]
                else:
                    slope=yd/xd
                    c=j[1]-slope*j[0]
                if (slope,c) not in d.keys():
                    d[(slope,c)]=[2,[points[i],j]]
                else:
                    if points[i] not in d[(slope,c)][1]:
                        d[(slope,c)][1].append(points[i])
                        d[(slope,c)][0]+=1
                    if j not in d[(slope,c)][1]:
                        d[(slope,c)][1].append(j)
                        d[(slope,c)][0]+=1
        for i in d.keys():
            print(i,d[i])
        if not d:
            return 1
        return max([i[0] for i in d.values()])
33026