Today's Challenge

https://leetcode.com/problems/max-points-on-a-line/

Max Points on a Line - LeetCode

기울기를 map으로 저장해서 처리하면 됨.

class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        if len(points) <= 2:
            return len(points)

        def line(p1, p2):
            if p2[0] - p1[0] == 0:
                return (p1[0])
            slope = (p2[1]-p1[1]) / (p2[0]-p1[0])
            b = p1[1] - slope * p1[0]
            return (slope, '%.5f' %b)
        
        res = 0

        for i in range(len(points)):
            count = defaultdict(int)
            for j in range(i+1, len(points)):
                count[line(points[i], points[j])] += 1
            if count:
                res = max(res, max(count.values()))

        return res + 1