力扣中对常用数据结构ListNode TreeNode 增加打印和创建api

为方便本地ide调试力扣的链表、树类型的题。拓展增强了ListNode、TreeNode 类的定义

from typing import List


class ListNode:
    def __init__(self, val: int = 0, next_=None):
        self.val = val
        self.next = next_

    @staticmethod
    def creatListNode(nums: List[int]):
        dummy = ListNode()
        p = dummy
        for i in range(len(nums)):
            p.next = ListNode(nums[i])
            p = p.next

        return dummy.next

    def __str__(self):
        if self.next:
            return str(self.val) + ' -> ' + self.next.__str__()
        else:
            return str(self.val)


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

    @staticmethod
    def creatTreeNode(nums: List[int]):
        """
        输入数组层序遍历构造二叉树
        [1, 2, 3, None, 4]
            1
           / \
          2   3
           \
           4
        """
        if len(nums) == 0:
            return None
        nums_copy = nums.copy()

        popped = nums_copy.pop(0)
        root = TreeNode(popped)
        q = [root]
        while len(nums_copy) > 0:
            node = q.pop(0)

            left = nums_copy.pop(0)
            if left is not None:
                node.left = TreeNode(left)
                q.append(node.left)
            if len(nums_copy) == 0:
                break
            right = nums_copy.pop(0)
            if right is not None:
                node.right = TreeNode(right)
                q.append(node.right)
        return root

    def __str_helper(self, prefix, isTail, sb):
        if self.right is not None:
            if isTail:
                sb = self.right.__str_helper("" + prefix + "│   ", False, sb)
            else:
                sb = self.right.__str_helper("" + prefix + "    ", False, sb)

        if isTail:
            sb = sb + prefix + "└── " + str(self.val) + "\n"
        else:
            sb = sb + prefix + "┌── " + str(self.val) + "\n"

        if self.left is not None:
            if isTail:
                sb = self.left.__str_helper("" + prefix + "    ", True, sb)
            else:
                sb = self.left.__str_helper("" + prefix + "│   ", True, sb)
        return sb

    def __str__(self):
        return self.__str_helper("", True, "")


if __name__ == '__main__':
    root = TreeNode.creatTreeNode([1, 2, 3, None, 5])
    print(root)

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值