Algorithms—149.Max Points on a Line

最新推荐文章于 2022-11-28 09:47:14 发布

原创最新推荐文章于 2022-11-28 09:47:14 发布 · 302 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

226 篇文章

订阅专栏

本文介绍了一种优化的直线判别算法，通过遍历判断和重点注意，实现对给定点集中的直线数量进行高效计算。该算法特别关注了直线上点的连续性和非连续性情况，有效提升了计算效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

思路：3点判断一直线，遍历判断，注意重点。

/**
 * Definition for a point.
 * class Point {
 *     int x;
 *     int y;
 *     Point() { x = 0; y = 0; }
 *     Point(int a, int b) { x = a; y = b; }
 * }
 */
public class Solution {
    public int maxPoints(Point[] points) {
        if (points.length<3) {
			return points.length;
		}
        int answer=2;
    	for (int i = 0; i < points.length; i++) {
			for (int j = i+1; j < points.length; j++) {
				if((points[i].x!=points[j].x)||(points[i].y!=points[j].y)){
					int sum=0;
					for (int k = 0; k < points.length; k++) {
						if (isStraight(points[i],points[j],points[k])) {
							sum++;
						}
					}
					if (sum>answer) {
						answer=sum;
					}
				}else {
					int sum=0;
					for (int k = 0; k < points.length; k++) {
						if ((points[k].x==points[j].x)&&(points[k].y==points[j].y)) {
							sum++;
						}
					}
					if (sum>answer) {
						answer=sum;
					}
				}
			}
		}
    	return answer;
    }
    public boolean isStraight (Point a,Point b,Point c){
    	return ((b.y-c.y)*(a.x-c.x))==((a.y-c.y)*(b.x-c.x));
    }
}

耗时：300ms，上游