寻找平面内共线点数最多的直线和点数

最新推荐文章于 2024-07-27 10:30:00 发布

为道为僧_何必区分

最新推荐文章于 2024-07-27 10:30:00 发布

阅读量697

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构文章标签：三点共线平面内共线点最多的直线

本文链接：https://blog.youkuaiyun.com/qq_32250495/article/details/75290296

import java.awt.Point;
import java.util.HashSet;
import java.util.Set;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		Point[] points = new Point[5];
		points[0] = new Point(-4, -4);
		points[1] = new Point(-8, -582);
		points[2] = new Point(-3, 3);
		points[3] = new Point(-9, -651);
		points[4] = new Point(9, 591);
		System.out.println(maxPoints(points));
		in.close();
	}

	public static int maxPoints(Point[] points) {
		
		if (points == null)
			return 0;
		if (points.length < 1)
			return 0;
		if (points.length == 1)
			return 1;
		if (points.length == 2)
			return 2;

		//使用hashset 来保存已经处理过的直线的斜率
		Set<Float> set = new HashSet<>();
		Point initPoint;
		int maxCount = 2;
		
		//选取两个初始点来构建一条直线 用到了两重循环，循环中 识别已经处理过的直线，避免重复
		for (int i = 0; i < points.length - 1; i++) {
			initPoint = points[i];
			
			for (int j = i + 1; j < points.length; j++) {