文章目录 一、重建二叉树二、数值的整数次方三、打印从 1 到最大的 n 位数四、二叉搜索树的后序遍历序列五、数组中的逆序对 一、重建二叉树 public class Solution {int[] preorder;HashMap<Integer, Integer> dic new HashMap<>();public TreeNode buildTree(in…
实现队列的代码测试
from collections import dequedeque1 deque([a, b, c])
deque1.append(1)
deque1.append(2)
deque1.append(3)
for i in range(4,20):deque1.append(i)print(deque1)deque1.popleft()print(deque1)运行结果
E:\Python\Python38\python.exe D:/pythonpro…