leetcode-4.16[56. 合并区间、面试题 04.04. 检查平衡性、700. 二叉搜索树中的搜索]（python解法）

题目1

题解1

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        intervals.sort(key = lambda x: x[0]) # 根据左区间从小到大排序
        res = [] 
        for i in range(len(intervals)):
            if i+1 < len(intervals) and inte rvals[i+1][0] <= intervals[i][1]: # 如果前一个区间第二位大于后一区间第一位，存在重叠
                if intervals[i][1] < intervals[i+1][1]:  # 如果前一个区间第二位小于后一区间第二位，不存在包含，只重叠
                    intervals[i+1][0] = intervals[i][0]
                else:
                    intervals[i+1] = intervals[i]
            else:
                res.append(intervals[i])
                
        return res

题目2

题解2

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
     # 计算以当前节点为根的树深度
    def Depth(self, root: TreeNode) -> int:
        if root is None:
            return 0
        return 1 + max(self.Depth(root.left), self.Depth(root.right))
        

    def isBalanced(self, root: TreeNode) -> bool:
        # 空树是AVL
        if not root:
            return True
        # 若左右子树深度超过1，非AVL
        if abs(self.Depth(root.left) - self.Depth(root.right)) > 1:
            return False
        # 递归执行，当出现不满足AVL性质的子树时，执行短路运算立即返回结果
        return self.isBalanced(root.left) and self.isBalanced(root.right)

题目3

题解3

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def searchBST(self, root: TreeNode, val: int) -> TreeNode:
        if root is None: #如果为空，直接pass
            return None
        else:
            if root.val == val: #如果等于目标值，返回该结点
                return root
            elif root.val >val: #大于目标值，搜索左子树
                return self.searchBST(root.left,val)
            else:    #小于目标值，搜索右子树
                return self.searchBST(root.right,val)

附上题目链接：

题目1链接
题目2链接
题目3链接