ZhShy

基本结构 栈 class Stack: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def push(self, item): self.items.append(item) def pop(self...

递归 数列求和 listSum(numList)=first(numList)+listSum(rest(numList))listSum(numList) = first(numList) + listSum(rest(numList))listSum(numList)=first(numList)+listSum(rest(numList)) def listsum(numList): ...

查找 顺序查找——O(n)O(n)O(n) 无序表查找 def sequentialSearch(alist, item): pos = 0 found = False while pos < len(alist) and not found: if alist[pos] == item: found = True ...