题目:
给定一个二维平面,平面上有 n 个点,求最多有多少个点在同一条直线上。
示例 1:
输入: [[1,1],[2,2],[3,3]]
输出: 3
解释:
^
|
| o
| o
| o
+------------->
0 1 2 3 4
示例 2:
输入: [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
输出: 4
解释:
^
|
| o
| o o
| o
| o o
+------------------->
0 1 2 3 4 5 6
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/max-points-on-a-line
方法一:
首先取出一个点作为基准点,依次计算其它点与基准点的斜率,用字典记录每个斜率的长度。依次选基准点,直到剩下的点小于当前最长长度。
class Solution:
def maxPoints(self, points: List[List[int]]) -> int:
max_number = 1
l = len(points)
if l==0:
return 0
for i in range(l):
num_points = {}
if l-i<=max_number:
break
T = 0 #相等点的附加值
num_points['s'] = 1
for j in range(i+1, l):
if points[i]==points[j]:
T+=1
else:
if points[i][0]-points[j][0]!=0: #防止保留出来的数相等,用dx/dy和dy/dx一起表示
k1 = (points[i][1]-points[j][1])/(points[i][0]-points[j][0])
else:
k1 = 'l'
if points[i][1]-points[j][1]!=0:
k2 = (points[i][0]-points[j][0])/(points[i][1]-points[j][1])
else:
k2 = 'h'
k = (k1, k2)
if k in num_points.keys():
num_points[k] += 1
max_number = max(max_number, num_points[k])
else:
num_points[k] = 2
max_number = max(max_number, num_points[k])
if T>=0:
for k in num_points.keys():
max_number = max(max_number, num_points[k]+T)
return max_number