leetcode -- Max Points on a Line -- 重点
来源:互联网 发布:windows命令行创建文件 编辑:程序博客网 时间:2024/05/22 00:24
https://leetcode.com/problems/max-points-on-a-line/
思路很简单,就是找出两两点的pair,看有多少pair的slope是一样的。
这里设想plane中有一条line就是我们要求的最多点的line,那么只要我们循环到这条line上的任意一个点,那么就可以找到与其共线的其他所有点,所以每次做二维循环,都reset一个dict,然后求这个dict中的max values。见code
这里要注意的是,对于i,只用scan j > i就可以了。例如,[ABCDEFG]里面BDFG共线,那么scan这个共线所有点中的第一个的时候,就可以scan到其余所有点。所以不需要对于每一个i点,去scan所有的j!=i
参考http://www.cnblogs.com/zuoyuan/p/3760628.html
class Solution(object): def maxPoints(self, points): """ :type points: List[Point] :rtype: int """ length = len(points) if length < 3: return length res = -1 for i in range(length): slope = {'inf': 0} samePointsNum = 1 for j in range(i + 1, length): if points[i].x == points[j].x and points[i].y != points[j].y: slope['inf'] += 1 elif points[i].x != points[j].x: k = 1.0 * (points[i].y - points[j].y) / (points[i].x - points[j].x) if k not in slope: slope[k] = 1 else: slope[k] += 1 else: samePointsNum += 1 res = max(res, max(slope.values()) + samePointsNum) return res
0 0
- leetcode -- Max Points on a Line -- 重点
- Max Points on a Line | leetcode
- Max Points on a Line LEETCODE
- 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] Max Points on a Line
- Leetcode: Max Points on a Line
- LeetCode OJ:Max Points on a Line
- Leetcode Max Points on a Line
- Leetcode: Max Points on a Line .
- [Leetcode] Max Points on a Line (Java)
- leetcode:【Max Points on a Line】
- Max Points on a Line - LeetCode
- LeetCode:Max Points on a Line
- [LeetCode] Max Points on a Line
- leetcode - Max Points on a Line
- jsp网页倒计时跳转页面
- 对象、类、组合的方法调用的内存分布图
- [Python标准库]bisect——维护有序列表
- Java工程师成神之路
- 关于ValueOperations的increment方法的解惑
- leetcode -- Max Points on a Line -- 重点
- COLING 2014 Paper Generating Supplementary Travel Guides from Social Media
- python安装一些类库的时候遇到这个问题
- Eclipse相关
- C++语言标识符的构成遵循规则
- 线段和圆/球的相交性检测
- 转置矩阵 in Java
- 代码块,继承及final关键字
- war,jar, ear包是啥