149. 直线上最多的点数
题目
给你一个数组 points
,其中 points[i] = [xi, yi]
表示 X-Y 平面上的一个点。求最多有多少个点在同一条直线上。
示例1
输入:points = [[1,1],[2,2],[3,3]]
输出:3
示例2
输入:points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
输出:4
提示
- 1 <= points.length <= 300
- points[i].length == 2
- -104 <= xi, yi <= 104
- points 中的所有点 互不相同
分析
三次循环,每次循环看两个点组成的直线,数组上有多少个点在这个直线上,最后取最大
代码
class Solution:
def maxPoints(self, points: List[List[int]]) -> int:
def judge(point0, point1, point2):
if point0[0]==point1[0] or point1[0]==point2[0]:
if point0[0]==point1[0] and point1[0]==point2[0]:
return True
return False
elif (point0[0]==point1[0] and point1[0]==point2[0]) or (point0[1]==point1[1] and point1[1]==point2[1]) or (((point2[1]-point1[1])/(point2[0]-point1[0]))==((point1[1]-point0[1])/(point1[0]-point0[0]))):
return True
return False
result = min(2, len(points))
for i in range(len(points)-result):
for j in range(i+1, len(points)-result+1):
cur = 2
for k in range(j+1, len(points)):
if judge(points[i], points[j], points[k]):
cur += 1
result = cur if cur>result else result
return result
结果
时间超过12%
内存超过85%