149. Max Points on a Line

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

写的简洁还是需要功底的

# Definition for a point.
class Point:
    def __init__(self, a=0, b=0):
        self.x = a
        self.y = b

import numpy as np
# consider same and inf slope in the loop is also ok
class Solution:
    def maxPoints(self, points):
        """
        :type points: List[Point]
        :rtype: int
        """
        l = len(points)
        m = 0
        for i in range(l):
            ix, iy = points[i].x, points[i].y
            same, d, slope = 1, {}, -1
            for j in range(i+1,l):
                jx, jy = points[j].x, points[j].y
                if ix==jx and iy==jy:
                    same+=1
                    continue
                elif ix==jx: slope='inf'
                else: slope=((iy-jy)*np.longdouble(1))/(ix-jx)
                d[slope] = d.get(slope, 0)+1
            m = max(m, (max(d.values()) if d else 0)+same)
        return m
    
s=Solution()
print(s.maxPoints([Point(0,0),Point(94911151,94911150),Point(94911152,94911151)]))


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值