不知名

摘要： #############这道题的解题思路：同从32题上到下打印二叉树，34题二叉树中和为某一值的路径# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None... 阅读全文

摘要： # -*- coding:utf-8 -*- class Solution: def PrintMinNumber(self, numbers): # write code here """采用冒泡排序的思想""" # 将list转为字符类型 strnumbers = list(map(str,numbers)) n = len(strnumbers) if n<=1: return ''.joi 阅读全文

摘要： def MergeSort(array): arrayLen = len(array) # 先判断边界条件 if arrayLen<1: return [] if arrayLen == 1: return array #做map操作，也就是divide index = arrayLen//2 arrayl... 阅读全文