链表（python）

创建链表（单向）（python）

class Node:
    def __init__(self, value=None, next=None):
        self.value = value
        self.next = next
        
class LinkedList:
    def __init__(self):
        self.head = Node()
        self.tail = None
        self.length = 0
        
    def peek(self):
        if not self.head.next:
            raise Exception("LinkedList is empty")
        return self.head.next
    
    def get_first(self):  #得到链表的第一个元素
        if not self.head.next:
            raise Exception("LinkedList is empty")
        return self.head.next
    
    def get_last(self):	 #得到链表的最后一个元素
        if not self.head.next:
            raise Exception("LinkedList is empty")
        node = self.head
        while node.next != None:
            node = node.next
        return node
    
    def get(self, index):  #得到第index个元素，从0开始
        if index < 0 or index >= self.length:
            raise Exception("index is out of bound")
        if not self.head.next:
            raise Exception("LinkedList is empty")
        node = self.head.next
        for i in range(index):
            node = node.next
        return node
    
    def add_first(self, value):  #添加链表第一个元素
        node = Node(value, None)
        node.next = self.head.next
        self.head.next = node
        self.length += 1
        
    def add_last(self, value):  #添加链表最后一个元素
        new_node = Node(value)
        node = self.head
        while node.next != None:
            node = node.next
        node.next = new_node
        self.length += 1
        
    def add(self, index, value):  #添加链表中第index个元素
        if index < 0 or index > self.length:
            raise Exception("index is out of bound")
        if not self.head.next:
            raise Exception("LinkedList is empty")
        new_node = Node(value)
        node = self.head
        for i in range(index):
            node = node.next
        new_node.next = node.next
        node.next = new_node
        self.length += 1
        
    def remove_first(self):  #删除链表的第一个元素
        if not self.head.next:
            raise Exception("LinkedList is empty")
        result = self.head.next
        self.head.next = self.head.next.next
        self.length -= 1
        return result.value
        
    def remove_last(self):   #删除链表的最后一个元素
        if not self.head.next:
            raise Exception("LinkedList is empty")
        node = self.head.next
        prev = self.head
        while node.next != None:
            prev = node
            node = node.next
        prev.next = None
        self.length -= 1
        return node.value
    
    def remove(self, index):   #删除链表的第index个元素
        if index < 0 or index > self.length:
            raise Exception("index is out of bound")
        if not self.head.next:
            raise Exception("LinkedList is empty")
        node = self.head
        for i in range(index):
            node = node.next
        result = node.next
        node.next = node.next.next
        self.length -= 1
        return result.value
    
    def printlist(self):   #打印输出链表的元素
        node = self.head.next
        while node:
            print(node.value, end=" ")
            node = node.next
        print("")