class Node(object):
def __init__(self, data=None, nex...
def isSameTree(p, q):
if p == None and q == None:
...
def maxDepth(root):
if not root:
retu...
深度遍历改变顺序就OK了#coding:utf-8
#二叉树的遍历
#简单的二叉树节点类
class Node(o...
def deep(root):
if not root:
return
print...
#coding:utf-8
#values是硬币的面值values = [ 25, 21, 10, 5, 1]
#...
尾递归def _recursion_merge_sort2(l1, l2, tmp):
if len(l1...
直接创建dict = {'name':'earth', 'port':'80'}工厂方法items=[('name...
Python GC主要使用引用计数（reference counting）来跟踪和回收垃圾。在引用计数的基础上，通...
引用和copy(),deepcopy()的区别import copy
a = [1, 2, 3, 4, ['a',...
