leetcode 88\89\104

最新推荐文章于 2024-09-27 15:30:00 发布

Riccca

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量135

点赞数

分类专栏： python leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Riccca/article/details/112860092

版权

leetcode 同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

python

16 篇文章 0 订阅

订阅专栏

88 合并两个有序数组

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        if m == 0: 
            # print('ok')
            nums1[:] = nums2
        p = m+n-1
        p1 = m-1
        p2 = n-1

        while p>=0 and p2>=0 and p1>=0:

            if nums2[p2] > nums1[p1]:
                nums1[p] = nums2[p2]
                p2 -= 1
            else:
                nums1[p] = nums1[p1]
                p1 -= 1
            p -= 1

        if p2 >= 0:
            while p>=0:
                nums1[p] = nums2[p2]
                p -= 1
                p2 -= 1

89 格雷编码

#两个连续的二进制数, 仅有一个bit的差异。
# X表示用0方法还是1方法，要交替搜索 
class Solution:
    def grayCode(self, n) :
        if n == 0:
            return [0]

        res = []

        def back(now, x):
            if len(now) == n:
                res.append(int(now, 2))
            elif x == 0:
                back(now + '0', 0)
                back(now + '1', 1)
            else:
                back(now + '1', 0)
                back(now + '0', 1)

        back('', 0)
        return res


# if __name__ == '__main__':
#     s = Solution()
#     print(s.grayCode(3))

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:
        if not root: return 0
        return max(self.maxDepth(root.left), self.maxDepth(root.right)) +1