<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 numpy as np

def get_line(p1, p2):
    x1, y1 = p1
    x2, y2 = p2
    if x1 == x2:
        return (np.inf, x1)
    else:
        m = (y2 - y1) / (x2 - x1)
        b = y1 - m * x1
        return (round(m, 10), round(b, 10))

class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        lines = {}
        n = len(points)
        if n <= 2:
            return n
        for i in range(n):
            for j in range(i):
                point1 = points[i]
                point2 = points[j]
                line = get_line(point1, point2)
                if line in lines:
                    lines[line] += 1
                else:
                    lines[line] = 1
        most_frequent_line = None
        highest_count = 0
        for line in lines:
            if lines[line] > highest_count:
                highest_count = lines[line]
                most_frequent_line = line
        m, b = most_frequent_line
        print(lines)
        if m == np.inf:
            return len([p for p in points if np.abs(p[0] - b) < 1e-6])
        else:
            return len([p for p in points if np.abs(m * p[0] + b - p[1]) < 1e-6])

39201