摘要:
题目描述: 方法一:dfs class Solution: def numIslands(self, grid: List[List[str]]) -> int: def dfs(grid,r,c): nr = len(grid) nc = len(grid[0]) if r<0 or c<0 or 阅读全文
摘要:
题目描述: class Solution: def maxAbsValExpr(self, arr1, arr2) -> int: def function(s1,s2): result1=[] result2=[] result3=[] result4=[] for i in range(len( 阅读全文
摘要:
题目描述: class Solution(object): def mctFromLeafValues(self, arr): """ :type arr: List[int] :rtype: int """ n = len(arr) f = {1: [0] * n} for l in range( 阅读全文
摘要:
恢复内容开始 题目描述: class Solution: def shortestAlternatingPaths(self, n: int, red_edges, blue_edges): def function(n,r,b): result=[[float("inf")]*2 for _ in 阅读全文
摘要:
题目描述: 方法一: class Solution(object): def numEquivDominoPairs(self, dominoes): """ :type dominoes: List[List[int]] :rtype: int """ f = {} ret = 0 for d i 阅读全文
摘要:
题目描述: 第一次提交:BFS O(N) O(N) # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # 阅读全文
摘要:
题目描述: 方法一:递归 # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = 阅读全文
摘要:
题目描述: 方法一: class Solution(object): def rob(self, nums): """ :type nums: List[int] :rtype: int """ def dp(nums): pre = 0 cur = 0 for i in nums: temp = 阅读全文
摘要:
题目描述: 方法一:O(N) O(N) class Solution(object): def rob(self, nums): """ :type nums: List[int] :rtype: int """ bp = [0] * (len(nums) + 2) for i in range(l 阅读全文
摘要:
题目描述; 第一次提交: class Solution(object): def hammingWeight(self, n): """ :type n: int :rtype: int """ n = str(bin(n)) count = 0 for i in n: if i == '1': c 阅读全文