Max Points on a Line | leetcode
2013-11-24 12:24
375 查看
Given n points
on a 2D plane, find the maximum number of points that lie on the same straight line.
以每个点为中心,然后遍历剩余点,找到所有的斜率,如果斜率相同,那么一定共线,每次更新最大点数,最后就是结果。排序O(nlog(n))再乘以n个点,总复杂度O(n2logn)
以每个点为中心,遍历其他点,找到所有的斜率,但是这是将斜率放到hash表中,O(n2)的复杂度
on a 2D plane, find the maximum number of points that lie on the same straight line.
以每个点为中心,然后遍历剩余点,找到所有的斜率,如果斜率相同,那么一定共线,每次更新最大点数,最后就是结果。排序O(nlog(n))再乘以n个点,总复杂度O(n2logn)
以每个点为中心,遍历其他点,找到所有的斜率,但是这是将斜率放到hash表中,O(n2)的复杂度
相关文章推荐
- Leetcode-max-points-on-a-line
- Leetcode: Max Points on a Line
- [leetcode] Max Points on a Line
- LeetCode Max Points on a Line
- [LeetCode]149. Max Points on a Line
- Leetcode3: Max Points on a Line
- Leetcode Max Points on a Line
- LeetCode刷题笔录Max Points on a Line
- leetcode面试题3:Max Points on a Line
- Leetcode: Max Points on a Line
- Max Points on a Line(leetcode)
- LeetCode: Max Points on a Line
- LeetCode-Max Points on a Line (Python)
- [LeetCode] Max Points on a Line
- LeetCode Max Points on a Line
- leetCode 149. Max Points on a Line
- (leetcode)Max Points on a Line
- 【leetcode】Max Points on a Line (python)
- LeetCode-Max Points on a Line
- Leetcode-Max Points on a Line