06 2020 档案
摘要：from typing import Listclass Solution: # 错误的思路，会超时。 def maxProfit1(self, prices: List[int]) -> int: if len(prices) <= 1:return 0 # 小于等于一天没法交易买和卖 # 进行双
阅读全文
摘要：from typing import Listclass Solution: def minimumTotal1(self, triangle: List[List[int]]) -> int: return self.dfs(triangle,0,0,len(triangle),0) # 深搜的做
阅读全文
摘要：这道题和第118题是一样的，需要注意这道题目对行数的要求 # 定义一个列表，用来存放数据 num_list = [] for index1 in range(rowIndex + 1): # 每一行要先添加一个空列表 num_list.append([]) # 注意这里的for循环的范围 for i
阅读全文
摘要：from typing import Listclass Solution: def generate(self, numRows: int) -> List[List[int]]: # 定义一个列表，用来存放数据 num_list = [] for index1 in range(numRows)
阅读全文
摘要：# Definition for a Node.class Node: def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None): self.val = val s
阅读全文
摘要：class Node: def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None): self.val = val self.left = left self.rig
阅读全文
摘要：# 看着大佬的题解做了出来，但写不出来题解 class Solution: def numDistinct(self,s:str,t:str) -> int: n1 = len(s) n2 = len(t) dp = [[0] * (n1 + 1) for _ in range((n2 + 1))]
阅读全文
摘要：class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = rightclass Solution: def flatten(self,
阅读全文
摘要：class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Nonea = TreeNode(1)b = TreeNode(2)c = TreeNode(3)a.left = ba.right =
阅读全文
摘要：class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Noneroot1 = TreeNode(1)root2 = TreeNode(2)root1.left = root2# 这道题也是递
阅读全文
摘要：# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None# 这道题是用深搜加上剪枝的算法来做的。# 遍历每一层节
阅读全文
摘要：class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None# 这道题就是用深搜算法来做的，只要找出一个和为sum的就可以class Solution: def hasPathSum(se
阅读全文
摘要：# Definition for a binary tree node.class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Nonefrom typing import Listclass
阅读全文
摘要：class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = Nonefrom typing import Listclass Solution: # 迭代的想法 def levelOrderBot
阅读全文
浙公网安备 33010602011771号