LeetCode - Max Points on a Line

最新推荐文章于 2022-03-21 01:40:48 发布

tontkeng

最新推荐文章于 2022-03-21 01:40:48 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/tontkeng/article/details/17244361

LeetCode 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个算法问题：给定平面上的n个点，找出这些点中最多有多少个点位于同一条直线上。通过计算每两点间的斜率，并利用哈希表记录相同斜率出现的次数来解决该问题。

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.
 * struct Point {
 *     int x;
 *     int y;
 *     Point() : x(0), y(0) {}
 *     Point(int a, int b) : x(a), y(b) {}
 * };
 */
class Solution {
public:
    int maxPoints(vector<Point> &points) {
        int result = 0;
	    for (int i = 0; i < points.size(); ++i) {
		std::unordered_map<string, int> number;
		int mx = 0;
		int same = 1;
		for (int j = i+1; j < points.size(); ++j) {
		    int x = points[j].x - points[i].x;
		    int y = points[j].y - points[i].y;

		    int g = gcd(x, y);

		    if (g !=0) {
		        x /= g;
		        y /= g;
			    mx = max(mx, ++number[to_string(x) + " " + to_string(y)]);
		    }
		    else {
			    same++;
			    continue;
		    }
		}

		result = max(result, (mx + same));
	    }

	    return result;
    }
    
    int gcd(int a, int b) {
         return a? a/abs(a)*abs(gcd(b%a, a)) : b;
    }
};