leetteel

目录

def borressort(alsit): n = len(alsit) t = [n-i-1 for i in range(n-1)] for i in t: t1 = alsit[0] for j in range(i): if t1 < alsit[j+1]: t1 = alsit[j+1] print(alsit, end='No Exchange\

def binarysearch(alist, item): if len(alist) == 0: return False else: midpoint = len(alist)//2 if alist[midpoint] == item: return True else: if item<alist[midpoint]: return

def listsum(numlist): if len(numlist) == 1: return numlist[0] else: return numlist[0]+listsum(numlist[1:])print(listsum([1,3,5,7,9]))

class Node: def __init__(self, initdata): self.data = initdata self.next = None def getData(self): return self.data def getNext(self): return self.next def setData(self, newdata): self.data = newda

创建一个新类来实现双端队列的数据类型，然后运用双端队列来实现回文问题。class Deque: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def addFont(self, item): self.items.append(item) def addRear(self, item): sel

class Queue: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def enqueue(self, item): self.items.insert(0, item) def dequeue(self): return self.items.pop() def size(self

递归解法def recDC(coinValueList, change, knownResults): minCoins = change if change in coinValueList: knownResults[change] = 1 return 1, knownResults elif knownResults[change] > 0: return knownResults[change], knownResul

动态规划算法import numpy as npdef recDC(coinValueList, change, knownResults): minCoins = change if change in coinValueList: knownResults[change] = 1 return 1, knownResults elif knownResults[change] > 0: return knownResu

代码：# Greedy Algorithmimport numpy as npdef change(big, real): money = [100, 50, 20, 10, 5, 1, 0.5, 0.1] mchange = 0 t = big-real amount = np.zeros((1, len(money)),dtype=int) i = 0 while t >= mchange: if (t-mchange)

栈class Stack: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def push(self, item): self.items.append(item) def peek(self): return self.items[len(self.items)-1] def siz