力扣算法题06-08

从头到尾打印链表

06.输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        # return self.reversePrint(head.next)+[head.val] if head else []

        if not head:return []
        return self.reversePrint(head.next)+[head.val]

总是搞不懂递归

重建二叉树

*****07.输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

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

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
              
        
        def recur(i, left, right):
            if left > right:
                return
            root = TreeNode(preorder[i])
            j = hashmap[preorder[i]]
            root.left = recur(i + 1, left, j - 1)
            root.right = recur(i + 1 + j - left, j + 1, right)
            return root
        
        hashmap = {}
        for i, val in enumerate(inorder):
            hashmap[val] = i
    
        return recur(0, 0, len(inorder) - 1)

又用了递归
没理解

两个栈实现队列

08.用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )

class CQueue:

    def __init__(self):
        self.A = []
        self.B = []

    def appendTail(self, value: int) -> None:
        self.A.append(value)

    def deleteHead(self) -> int:
        if self.B:
            return self.B.pop()
        if not self.A:
            return -1
        while self.A:
            self.B.append(self.A.pop())
        return self.B.pop()

要学会灵活应用啊