New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

【Day58】149. 直线上最多的点数 | Shawlon`s Blog #13

Open

MUYIio opened this issue Aug 10, 2021 · 0 comments

Labels

day58-149-zhi-xian-shang-zui-duo-de-dian-shu.html Gitalk

Owner

MUYIio commented Aug 10, 2021

https://www.yshawlon.cn/day58-149-zhi-xian-shang-zui-duo-de-dian-shu.html

直线上最多的点数给你一个数组 points ，其中 points[i] = [xi, yi] 表示 X-Y 平面上的一个点。求最多有多少个点在同一条直线上。
示例 1：

输入：points = [[1,1],[2,2],[3,3

MUYIio added Gitalk day58-149-zhi-xian-shang-zui-duo-de-dian-shu.html labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment