algorithm
文章平均质量分 64
Minkowski_lin
这个作者很懒,什么都没留下…
展开
-
LeetCode870. 优势洗牌(贪心算法) Python实现
LeetCode870. 优势洗牌(贪心算法)贪心策略: 田忌赛马codeclass Solution: def advantageCount(self, A: list, B: list) -> list: l = len(A) ans = [0 for _ in range(l)] b = sorted(lis...原创 2019-03-01 14:10:21 · 462 阅读 · 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 · 213 阅读 · 0 评论 -
LeetCode337. 打家劫舍 III(DFS记忆化搜索)
LeetCode337. 打家劫舍 III(DFS记忆化搜索)# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution:...原创 2019-03-24 18:55:40 · 246 阅读 · 0 评论 -
LeetCode279. 完全平方数(DP+四平方和)
LeetCode279. 完全平方数(DP+四平方和)转化为完全背包的DP问题from math import sqrtclass Solution: def numSquares(self, n: int) -> int: ans = n maxn = int(sqrt(n)) dp = [_ for _ in range(...原创 2019-03-08 12:52:53 · 298 阅读 · 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 · 1191 阅读 · 0 评论 -
LeetCode142. 环形链表 II(快慢指针)
快慢指针参考https://zhuanlan.zhihu.com/p/30990994?utm_source=qq&utm_medium=social&utm_oi=1080275092017270784# Definition for singly-linked list.class ListNode(object): def __init__(self, x):...原创 2019-03-06 23:45:18 · 138 阅读 · 0 评论 -
LeetCode141. 环形链表(快慢指针)
LeetCode141. 环形链表(快慢指针)快慢指针参考https://zhuanlan.zhihu.com/p/30990994?utm_source=qq&utm_medium=social&utm_oi=1080275092017270784# Definition for singly-linked list.class ListNode(object): ...原创 2019-03-06 23:17:35 · 210 阅读 · 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 · 100 阅读 · 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 · 466 阅读 · 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 评论 -
LeetCode101. 对称二叉树 (递归) + (迭代)
LeetCode101. 对称二叉树 (递归) + (迭代)递归class Solution: def isSymmetric(self, root): """ :type root: TreeNode :rtype: bool """ if root: return sel...原创 2019-03-01 17:12:11 · 415 阅读 · 0 评论