LeetCode Max Points on a Line

题意：给定一些二维坐标，求多少个点在同一条直线上

解法：明显的极角排序，卡了几下，发现这道题目比uva 270多了几种情况。

1、先说这道题目的极角排序：O（n）遍历一遍，枚举极角排序的中心点。然后构造向量，进行极角排序。排序结束，根据差乘判断（假设只有一个中心点，即任意两个点坐标都不同），有多少个点在一条直线上。即为返回值ret。

2、题目可能有重复点。这个就需要我们把重复的点找出来。极角排序的结果是ret，有k个原点（即中心点）在构造向量的过程中就直接省去，那么应该返回ret+k-1。代码中k=n-cnt。

3、更加极限的情况，很多个中心点（即为很多点都是同一个点）===》如果k==n或者k+1==n，那么直接返回n。

<span style="font-size:18px;">import java.util.Arrays;
import java.util.Comparator;

class Solution {
	Comparator<Point> cmp = new Comparator<Point>() {
		public int compare(Point v1, Point v2) {
			double ang1 = Math.atan2(v1.y, v1.x);
			double ang2 = Math.atan2(v2.y, v2.x);
			if (ang1 < ang2)
				return -1;
			else if (ang1 > ang2)
				return 1;
			return 0;
		}
	};

	int getNumber(Point[] points, int C) {
		int n = points.length;
		Point tpoints[] = new Point[n];
		int cnt = 0, tx, ty;
		for (int i = 0; i < n; i++) {
			tx = points[i].x - points[C].x;
			ty = points[i].y - points[C].y;
			if (tx == 0 && ty == 0)
				continue;
			else
				tpoints[cnt++] = new Point(tx, ty);
		}
		Arrays.sort(tpoints, 0, cnt, cmp);

		if (cnt >= 2) {
			int ret = 2;
			int number = 2;
			for (int i = 1; i < cnt; i++) {
				if (tpoints[i].x * tpoints[i - 1].y == tpoints[i].y
						* tpoints[i - 1].x) {
					number++;
				} else {
					number = 2;
				}
				ret = Math.max(ret, number);
			}
			return ret + n - cnt - 1;
		} else {
			return n;
		}
	}

	public int maxPoints(Point[] points) {
		int n = points.length;
		if (n <= 2)
			return n;

		int max = 2;
		for (int c = 0; c < n; c++) {
			max = Math.max(max, getNumber(points, c));
		}
		return max;
	}

	// static Point[] points = new Point[] { new Point(0, -12), new Point(5, 2),
	// new Point(2, 5), new Point(0, -5), new Point(1, 5),
	// new Point(2, -2), new Point(5, -4), new Point(3, 4),
	// new Point(-2, 4), new Point(-1, 4), new Point(0, -5),
	// new Point(0, -8), new Point(-2, -1), new Point(0, -11),
	// new Point(0, -9) };

	static Point[] points = new Point[] { new Point(0, 0), new Point(2, 2),
			new Point(-1, -1) };

	public static void main(String[] args) {
		Solution s = new Solution();
		System.out.println(s.maxPoints(points));
		// System.out.println(Math.atan2(9, -1));
		// System.out.println(Math.atan2(9, -2));
		// System.out.println(Math.atan2(0, 0));

	}
}

class Point {
	int x;
	int y;

	Point() {
		x = 0;
		y = 0;
	}

	Point(int a, int b) {
		x = a;
		y = b;
	}
}
</span>