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.

算斜率的时候一定注意要格式转换,integer-〉double

/**
 * Definition for a point.
 * class Point {
 *     int x;
 *     int y;
 *     Point() { x = 0; y = 0; }
 *     Point(int a, int b) { x = a; y = b; }
 * }
 */
import java.util.Hashtable;
public class Solution {
	public int maxPoints(Point[] points) {
		if(points.length < 1)
			return 0;
		int res = 0;
		Hashtable<Double, Integer> table = new Hashtable<Double, Integer>();
		for(int i = 0; i < points.length; i++){
			table.clear();
			int max = 0;
			int duplicate = 1;
			int vertical = 0;
			for(int j = 0; j < points.length; j++){
				if(j == i)
					continue;
				if(points[j].x == points[i].x && points[j].y == points[i].y){
					duplicate++;
					continue;
				}
				if(points[j].x == points[i].x){
					vertical++;
					continue;
				}
				double k = (double)(points[j].y - points[i].y) / (points[j].x - points[i].x);
				if(!table.containsKey(k))
					table.put(k, 1);
				else
					table.put(k, table.get(k) + 1);
			}
			for(Iterator<Double> it = table.keySet().iterator(); it.hasNext();){
				int cur = table.get(it.next());
				max = max > cur ? max : cur;
			}
			max = max > vertical ? max : vertical;
			max += duplicate;
			res = res > max ? res : max;
		}
		return res;
	}
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值