午夜国产狂喷潮在线观看|国产AⅤ精品一区二区久久|中文字幕AV中文字幕|国产看片高清在线

    python列表操作實例
    來源:易賢網(wǎng) 閱讀:855 次 日期:2015-01-16 14:04:49
    溫馨提示:易賢網(wǎng)小編為您整理了“python列表操作實例”,方便廣大網(wǎng)友查閱!

    本文實例講述了python列表操作的方法。分享給大家供大家參考。

    具體實現(xiàn)方法如下:

    復制代碼 代碼如下:class Node:

    """Single node in a data structure"""

    def __init__(self, data):

    """Node constructor"""

    self._data = data

    self._nextNode = None

    def __str__(self):

    """Node data representation"""

    return str(self._data)

    class List:

    """Linked list"""

    def __init__(self):

    """List constructor"""

    self._firstNode = None

    self._lastNode = None

    def __str__(self):

    """List string representation"""

    if self.isEmpty():

    return "empty"

    currentNode = self._firstNode

    output = []

    while currentNode is not None:

    output.append(str(currentNode._data))

    currentNode = currentNode._nextNode

    return " ".join(output)

    def insertAtFront(self, value):

    """Insert node at front of list"""

    newNode = Node(value)

    if self.isEmpty(): # List is empty

    self._firstNode = self._lastNode = newNode

    else: # List is not empty

    newNode._nextNode = self._firstNode

    self._firstNode = newNode

    def insertAtBack(self, value):

    """Insert node at back of list"""

    newNode = Node(value)

    if self.isEmpty(): # List is empty

    self._firstNode = self._lastNode = newNode

    else: # List is not empty

    self._lastNode._nextNode = newNode

    self._lastNode = newNode

    def removeFromFront(self):

    """Delete node from front of list"""

    if self.isEmpty(): # raise exception on empty list

    raise IndexError, "remove from empty list"

    tempNode = self._firstNode

    if self._firstNode is self._lastNode: # one node in list

    self._firstNode = self._lastNode = None

    else:

    self._firstNode = self._firstNode._nextNode

    return tempNode

    def removeFromBack(self):

    """Delete node from back of list"""

    if self.isEmpty(): # raise exception on empty list

    raise IndexError, "remove from empty list"

    tempNode = self._lastNode

    if self._firstNode is self._lastNode: # one node in list

    self._firstNode = self._lastNode = None

    else:

    currentNode = self._firstNode

    # locate second-to-last node

    while currentNode._nextNode is not self._lastNode:

    currentNode = currentNode._nextNode

    currentNode._nextNode = None

    self._lastNode = currentNode

    return tempNode

    def isEmpty(self):

    """Returns true if List is empty"""

    return self._firstNode is None

    希望本文所述對大家的Python程序設(shè)計有所幫助。

    更多信息請查看IT技術(shù)專欄

    更多信息請查看腳本欄目
    易賢網(wǎng)手機網(wǎng)站地址:python列表操作實例

    2025國考·省考課程試聽報名

    • 報班類型
    • 姓名
    • 手機號
    • 驗證碼
    關(guān)于我們 | 聯(lián)系我們 | 人才招聘 | 網(wǎng)站聲明 | 網(wǎng)站幫助 | 非正式的簡要咨詢 | 簡要咨詢須知 | 新媒體/短視頻平臺 | 手機站點 | 投訴建議
    工業(yè)和信息化部備案號:滇ICP備2023014141號-1 云南省教育廳備案號:云教ICP備0901021 滇公網(wǎng)安備53010202001879號 人力資源服務許可證:(云)人服證字(2023)第0102001523號
    聯(lián)系電話:0871-65099533/13759567129 獲取招聘考試信息及咨詢關(guān)注公眾號:hfpxwx
    咨詢QQ:1093837350(9:00—18:00)版權(quán)所有:易賢網(wǎng)