算法打卡记录-第一周-递归

简单

104. 二叉树的最大深度

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        a = 0
        if not root:
            return 0
        else:
            return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))

62. 不同路径

class Solution:
    a = {}
    def uniquePaths(self, m: int, n: int) -> int:

        if (m,n) in self.a:
            return self.a[m,n]
        if m == 1 or n == 1:
            return 1
        self.a[m,n] = self.uniquePaths(m - 1, n) + self.uniquePaths(m, n - 1)
        return self.uniquePaths(m - 1, n) + self.uniquePaths(m, n - 1)

剑指 Offer 16. 数值的整数次方

class Solution:
    def myPow(self, x: float, n: int) -> float:
        if n == 0:
            return 1
        elif n < 0:
            return 1/self.myPow(x, -n)
        elif n & 1:
            return x * self.myPow(x, n - 1)
        else:
            return self.myPow(x*x, n // 2)

4. 寻找两个正序数组的中位数
不会用递归

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        num = nums1 + nums2
        num = sorted(num)

        if len(num) % 2 == 1:
            return float(num[len(num) // 2])
        else:
            return (num[len(num) // 2] + num[len(num) // 2 - 1]) / 2