<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:

        if len(points) == 1:
            return 1
        if len(points) == 2:
            return 2

        pair_points = []
        for i in range(len(points)):
            for j in points[i+1:]:
                pairs=[]
                pairs.append(points[i])
                pairs.append(j)
                pair_points.append(pairs)
               
        

        for i in (pair_points):
            for j in points:
                area = j[0]*(i[0][1] - i[1][1]) + i[0][0]*(i[1][1] - j[1])+i[1][0]*(j[1]-i[0][1])
                if j not in i and area == 0:
                    i.append(j)
        max = len(pair_points[0])
        for i in range(len(pair_points) -1):
            if len(pair_points[i])> max:
                max = len(pair_points[i])
        print(pair_points)
        return max
        






        
23146