摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def isBalanced(self, root: TreeNode) -> bool: if r 阅读全文
摘要：
def insertSort(data): len_ = len(data) for i in range(1, len_): for j in range(i): if data[i] < data[j]: data.insert(j, data[i]) # 如果碰到比自己小的数，在自己前面插入这... 阅读全文