题目：

题解：

class Solution:def maxPoints(self, points: List[List[int]]) -> int:n = len(points)if n <= 2:return nres = 2for i in range(n):x1, y1 = points[i][0], points[i][1]has = {}for j in range(i + 1, n):x2, y2 = points[j][0], points[j][1]if x1 == x2:a, b, c = 1, 0, -x1elif y1 == y2:a, b, c = 0, 1, -y1else:a = 1.0b = 1.0 * (x1 - x2) / (y2 - y1)c = 1.0 * (x1 * y2 - x2 * y1) / (y1 - y2)if (a,b,c) in has.keys():has[(a,b,c)]+=1res = max(res,has[(a,b,c)])else:has[(a,b,c)] = 2return res