Leetcode no. 149

最新推荐文章于 2024-03-08 10:00:41 发布

SmithZz

最新推荐文章于 2024-03-08 10:00:41 发布

阅读量447

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/smithzz/article/details/52039565

版权

leetcode 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

149. 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.
 * 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<= 2) return points.length;
        int res=0;
        for (int i = 0; i < points.length; i++) {
            int infinite=1, samepoint=0;
            Map<Double, Integer> map= new HashMap<>();
            for (int j = 0; j < points.length; j++) {
                if (i==j) continue;
                if ((points[i].x== points[j].x)&& (points[j].y== points[i].y)) samepoint++;
                if (points[i].x== points[j].x){
                    infinite++;
                    continue;
                }
                double angle= ((double)(points[j].y-points[i].y))/((double)(points[j].x-points[i].x));
                if (map.containsKey(angle)) map.put(angle, map.get(angle)+1);
                else map.put(angle, 2);
                res= Math.max(res, map.get(angle)+samepoint);
            }
            res= Math.max(res, infinite);
        }
        return res;
    }
}