Jillian_sea的博客

# -*- coding:utf-8 -*-class TreeNode(): def __init__(self,x): self.data = x self.left = None self.right = None# 思路：　二叉搜索树的中序遍历是一个单调递增的序列，最小值一定在左子树的最左边叶子节点，最大值在右子树的最右边叶子节...

s竖式乘法和加法：from random import randintdef Mul(str1,str2): num1 = list(map(int, reversed(str1))) num2 = list(map(int, reversed(str2))) res = [0]*(len(num1)+len(num2)) for index2, val2 i...