摘要：
递归找最小 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # 阅读全文
posted @ 2021-06-26 16:11
泊鸽
阅读(80)
评论(0)
推荐(0)
摘要：
递归 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # se 阅读全文
posted @ 2021-06-26 15:58
泊鸽
阅读(47)
评论(0)
推荐(0)
摘要：
1）开挂调库 import itertools class Solution: def permute(self, nums: List[int]) -> List[List[int]]: n = len(nums) result = [] for i in itertools.permutatio 阅读全文
posted @ 2021-06-26 15:30
泊鸽
阅读(62)
评论(0)
推荐(0)
浙公网安备 33010602011771号