<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:
    r = 12
    def kb(p1,p2):
      if round(p1[0]-p2[0],r)==0:
        return float('inf'), round(p1[0],r)

      k = (p1[1]-p2[1])/(p1[0]-p2[0])
      b = p1[1]-p1[0]*k
      return round(k,r),round(b,r)

    l = len(points)
    if l == 1: return 1
    lines = dict()
    for i in range(l-1):
      s = set([kb(points[i], points[j]) for j in range(i+1,l)])
      for kb1 in s:
        lines.setdefault(kb1, 1)
        lines[kb1] += 1
    return max(x for x in lines.values())

26234