Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (15)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (10)
  • Network (66)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (3)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [LeetCode 149] Max Points on a Line

    Published Apr 10, 2022 [  Map  ]

    Problem

    Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line.

    Example 1:

    Input: points = [[1,1],[2,2],[3,3]]
    Output: 3
    

    Example 2:

    Input: points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
    Output: 4
    

    Constraints:

    • 1 <= points.length <= 300
    • points[i].length == 2
    • -10^4 <= xi, yi <= 10^4
    • All the points are unique.

    Thoughts

    • Same slope means point on the line
    • Vertical line is special case

    TypeScript

    function maxPoints(points: number[][]): number {
        if(points.length < 3) {
            return points.length;
        }
        
        let res = 0;
        
        for(let i = 0; i < points.length; i++){
            const slopes: {[index: number]: number} = {Infinity: 0}
            for(let j = i + 1; j < points.length; j++){
                const xDiff = points[i][0] - points[j][0];
                const yDiff = points[i][1] - points[j][1];
                const slope = xDiff === 0 ? Infinity : yDiff/xDiff;
                
                // same slope means more points on a line
                slope in slopes ? slopes[slope]++ : slopes[slope] = 1
                
                res = Math.max(res, slopes[slope])
            }
        }
        
        // we didn't count the first point, so add 1
        return res + 1;
    };
    

    Reference