max-points-on-a-line leetcode C++

最新推荐文章于 2020-06-26 21:34:51 发布

DarrenXf

最新推荐文章于 2020-06-26 21:34:51 发布

阅读量231

点赞数

分类专栏： Algorithm 牛客网 C++ 算法 leetcode 文章标签： C leetcode 牛客网算法

本文链接：https://blog.csdn.net/DarrenXf/article/details/82768381

版权

算法同时被 3 个专栏收录

149 篇文章 0 订阅

订阅专栏

Algorithm

147 篇文章 0 订阅

订阅专栏

牛客网

146 篇文章 0 订阅

订阅专栏

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

C++

/**
 * 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) {
		unordered_map<float,int> mp;
		int maxNum = 0;
		for(int i = 0; i < points.size(); i++){
			mp.clear();
			mp[INT_MIN] = 0;
			int duplicate = 1;
			for(int j = 0; j < points.size(); j++)
			{
				if(j == i) continue;
				if(points[i].x == points[j].x && points[i].y == points[j].y){
					duplicate++;
					continue;
				}
				float k = points[i].x == points[j].x ? INT_MAX : (float)(points[j].y - points[i].y)/(points[j].x - points[i].x);
				mp[k]++;
			}
			unordered_map<float, int>::iterator it = mp.begin();
			for(; it != mp.end(); it++)
				if(it->second + duplicate > maxNum)
					maxNum = it->second + duplicate;
		}
		return maxNum;
    }
};