Python基本資料結構

來源:互聯網
上載者:User

標籤:range   資料結構   push   while   ide   converter   font   turn   dex   

棧
class Stack:    def __init__(self):        self.items = []
def isEmpty(self): return self.items == [] def push(self, item): self.items.append(item) def pop(self): return self.items.pop() def peek(self): return self.items[len(self.items)-1] def size(self): return len(self.items)
隊列
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):        return len(self.items)
雙端隊列
class Deque:    def __init__(self):        self.items = []    def isEmpty(self):        return self.items == []    def addFront(self, item):        self.items.append(item)    def addRear(self, item):        self.items.insert(0,item)    def removeFront(self):        return self.items.pop()    def removeRear(self):        return self.items.pop(0)    def size(self):        return len(self.items)
應用括弧匹配:
def check(s):lefts = [‘(‘, ‘[‘, ‘{‘]rights = [‘)‘, ‘]‘, ‘}‘]stack = Stack()for c in s:if c in lefts:stack.push(c)else:if stack.is_empty():return Falsec_pop = stack.pop()if lefts.index(c_pop) != rights.index(c):return Falseif stack.is_empty:return Truereturn False
進位轉換
def divideBy2(decNumber):reback = Stack()while (decNumber > 0):reback.push(decNumber % 2)decNumber = decNumber // 2binstr = ‘‘while not reback.is_empty():binstr = binstr + str(reback.pop())return binstrdef baseConverter(decNumber, base):‘‘‘將十進位數字轉成任意進位數字‘‘‘digits = ‘0123456789ABCDEF‘reback = Stack()while (decNumber > 0):reback.push(decNumber % base)decNumber = decNumber // basebasestr = ‘‘while not reback.is_empty():basestr = basestr + digits[reback.pop()]return basestr
兩個棧實現隊列
# coding:utf-8from pythonds.basic.stack import Stackclass StacToQueue(object):def __init__(self):self.stack_one = Stack()self.stack_two = Stack()def push(self, item):self.stack_one.push(item)def pop(self):if self.stack_two.isEmpty():while not self.stack_one.isEmpty():self.stack_two.push(self.stack_one.pop())return self.stack_two.pop()def size(self):return len(self.stack_one) + len(self.stack_two)def isEmpty(self):return self.size() == 0if __name__ == ‘__main__‘:queue = StacToQueue()for x in range(5):queue.push(x)for x in range(5):print(queue.pop())

 

Python基本資料結構

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.