![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
文章平均质量分 64
Minkowski_lin
这个作者很懒,什么都没留下…
展开
-
LeetCode695 岛屿的最大面积(DFS)
LeetCode695 岛屿的最大面积(DFS)class Solution: def __init__(self): self.tmp = 0 def maxAreaOfIsland(self, grid: 'List[List[int]]') -> 'int': w = len(grid) h =len(grid[0]...原创 2019-02-25 17:31:05 · 260 阅读 · 0 评论 -
Dinic算法_网络最大流
Dinic算法_网络最大流Python versionclass Dinic: '''Dinic algorithm''' def __init__(self, V:int, E:int, graph:'List[List[int]]', S:int, T:int): self.n, self.m = V, E # V = |Vertices|, E = ...原创 2019-04-30 20:05:14 · 214 阅读 · 0 评论 -
LeetCode743. 网络延迟时间(Dijkstra算法)
LeetCode743. 网络延迟时间(Dijkstra算法)codeclass Solution: def networkDelayTime(self, times: list, N: int, K: int) -> int: inf = int(1e9) g = [[int(1e9)] * N for _ in range(N)] ...原创 2019-03-12 00:21:48 · 1194 阅读 · 0 评论 -
LeetCode112.路径总和
LeetCode112.路径总和version 1# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution: ...原创 2019-02-27 09:46:06 · 102 阅读 · 0 评论 -
LeetCode104.二叉树的最大深度 (BFS)+(递归)两种方法
LeetCode104.二叉树的最大深度 (BFS)+(递归)两种方法BFS# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None ...原创 2019-02-26 15:52:07 · 467 阅读 · 0 评论 -
LeetCode111. 二叉树的最小深度 (BFS) + (递归)两种方法
LeetCode111. 二叉树的最小深度 (BFS) + (递归)两种方法BFS# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None ...原创 2019-02-26 15:42:25 · 342 阅读 · 0 评论 -
LeetCode47. 全排列 II:(DFS) + (import itertools)
LeetCode47. 全排列 II:(DFS) + (import itertools)class Solution: def __init__(self): self.n = None self.v = None self.tmp = () self.tmp_ans = [] def permuteUnique...原创 2019-02-26 00:36:03 · 128 阅读 · 0 评论 -
LeetCode46. 全排列 两种方法:(DFS) + (import itertools)
LeetCode46. 全排列(DFS)class Solution: def __init__(self): self.v = None self.n = None self.tmp = [] self.ans = [] def permute(self, nums): self.n = len(...原创 2019-02-25 23:53:54 · 251 阅读 · 0 评论 -
LeetCode513 找树左下角的值(BFS)
LeetCode513 找树左下角的值(BFS)BFS算法层层遍历,记录每层的最左边的结点的值# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = No...原创 2019-02-25 21:16:47 · 105 阅读 · 0 评论