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


import dataclasses 
from typing import Dict, List
@dataclasses.dataclass
class Point:

    x : int
    y : int
    lines : Dict[float , int]  # mapping slope to # of points in that line 

    def get_slope(self, other_point : "Point"):
        if other_point.x - self.x == 0:
            return float("inf")
        return (other_point.y- self.y) / (other_point.x- self.x) 

    def update_line_size(self, other_point : "Point") -> int:
        # update line size of lines that meet the other point, returning the new # of points in the line after adding the other point 
        slope = self.get_slope(other_point)

        if slope in other_point.lines:
            
            other_point.lines[slope] += 1
            self.lines[slope] = other_point.lines[slope]
        else:
            other_point.lines[slope] = 2
            self.lines[slope] = 2
        
        
        return other_point.lines[slope]





def get_point_counts(points):
    out = []
    for pos in points:
        x,y = pos
        out.append(Point(x =x, y=y, lines = {}))

    return out


class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        if len(points) == 1:
            return 1
        points : List[Point] = get_point_counts(points) # tuple of points
        ans = 0
        for i in range(len(points)):
            for j in range(i): # only iterate over previous points so we dont overcount

                ans = max(ans, points[i].update_line_size(points[j]))

        return ans
20676