python 链表实现

列表和链表可以看成是物理结构；
列表的优势在于能够快速定位元素，对于读操作多，写操作少的场景，用列表更快。
链表的优势在于能够灵活的插入和删除数据，如果是需要频繁的插入和删除元素，用链表更合适

class Node:
    def __init__(self,data):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.size = 0
        self.head = None
        self.last = None

    def get(self,index):
        if index<0 or index>=self.size:
            print('超出范围')
        p = self.head
        for i in range(index):
            p = p.next
        return p

    def insert(self,data,index):
        if index<0 or index>self.size:
            print("超出范围")
        node = Node(data)
        if self.size == 0:
            self.head = node
            self.last = node
        elif index == 0:
            node.next = self.head
            self.head = node
        elif self.size == index:
            self.last.next = node
            self.last = node
        else:
            prev_node = self.get(index-1)
            node.next = prev_node.next
            prev_node.next = node
        self.size += 1

    def remove(self,index):
        if index<0 or index>=self.size:
            print("超出范围")
        if index == 0:
            removed_node = self.head
            self.head = self.head.next
        elif index == self.size-1:
            prev_node = self.get(index-1)
            removed_node = prev_node.next
            prev_node.next = None
            self.last = prev_node
        else:
            prev_node = self.get(index-1)
            next_node = prev_node.next.next
            removed_node = prev_node.next
            prev_node.next = next_node
        self.size -= 1
        return removed_node

    def output(self):
        p = self.head
        print('p:',p)
        while p is not None:
            print('--',p.data)
            p = p.next


linkedList = LinkedList()

for i in range(1000000):
    linkedList.insert(i,0)
linkedList.output()