Leetcode No.149 直线上最多的点数

示例 1：
 输入：points = [[1,1],[2,2],[3,3]]
 输出：3
示例 2：
 输入：points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
 输出：4
提示：
 1 <= points.length <= 300
 points[i].length == 2
 -104 <= xi, yi <= 104
 points 中的所有点 互不相同

public class Solution {
    public int maxPoints(int[][] points) {
        int n = points.length;
        int ans = 1;
        for (int i = 0; i < n; i++) {
            int[] x = points[i];
            for (int j = i + 1; j < n; j++) {
                int[] y = points[j];
                int cnt = 2;
                for (int k = j + 1; k < n; k++) {
                    int[] p = points[k];
                    int s1 = (y[1] - x[1]) * (p[0] - y[0]);
                    int s2 = (p[1] - y[1]) * (y[0] - x[0]);
                    if (s1 == s2) cnt++;
                }
                ans = Math.max(ans, cnt);
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        Solution solution=new Solution();
        int[][] points={{1,1},{2,2},{3,3}};
        System.out.println(solution.maxPoints(points));
    }
}