Re: [閒聊] 每日leetcode

[argorok (死肥肥社管)]

: https://leetcode.com/problems/add-one-row-to-tree
: 623. Add One Row to Tree
: 給你一個二元樹，請在深度為depth的位置插入一列值為val的節點。



今天遞迴解起來還蠻順的

感覺有點手感了


class Solution(object):
    def addOneRow(self, root, val, depth):
        """
        :type root: TreeNode
        :type val: int
        :type depth: int
        :rtype: TreeNode
        """
        if depth == 1:
            return TreeNode(val, left=root)
        if depth == 2:
            if root:
                tmpLeft = TreeNode(val, left=root.left)
                tmpRight = TreeNode(val, right=root.right)
                root.left = tmpLeft
                root.right = tmpRight
        elif depth > 2:
            if root.left:
                self.addOneRow(root.left, val, depth-1)
            if root.right:
                self.addOneRow(root.right, val, depth-1)
        return root


--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 36.228.105.80 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1713232714.A.730.html
※ 編輯: argorok (36.228.105.80 臺灣), 04/16/2024 10:01:17
推 JIWP: 別卷了
推 DJYOSHITAKA: 別捲了