无序链表，有序链表的实现(Python)

链表是一种存储结构不连续的动态数据结构，根据数据项有无按照顺序放置分为无序链表和有序链表
链表实现的最基本元素是节点Node
每个节点至少包含两个信息:数据项本身，以及指向下一个节点的引用信息,其中最为重要的为头节点和尾节点，next为None时的意义是指链表已经指向了尾部

python Node类的实现

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 = newdata

    def setNext(self, newnext):
        self.next = newnext

无序链表的实现包括增删查改，其中add考虑到复杂度应该将新数据项加入到链首，当实现remove时，应该将前一个结点的next指向current的下一个节点

Python UnorderedList类的实现

class UnorderedList:
    def __init__(self):
        self.head = None

    def isEmpty(self):
        return self.head is None

    def add(self, item):
        temp = Node(item)
        temp.setNext(self.head)
        self.head = temp

    def remove(self, item):
        current = self.head
        previous = None
        found = False
        while current is not None and not found:
            if current.getData() == item:
                found = True
            else:
                previous = current
                current = current.getNext()
        if not found:
            return print('The linked list does not have this value:{}'.format(item))
        if not previous:
            self.head = current.getNext()
        else:
            previous.setNext(current.getNext())

    def length(self):
        current = self.head
        count = 0
        while current:
            count += 1
            current = current.getNext()
        return count

    def search(self, item):
        current = self.head
        found = False
        while current and not found:
            if current.getData() == item:
                found = True
            else:
                current = current.getNext()
        return found

    def traverse(self):
        current = self.head
        while current:
            print(current.getData())
            current = current.getNext()

** 根据数据项有无排序，有序链表与无序链表的主要区别是add操作与search操作，有序链表的查找复杂度更低，但是add操作更繁琐

Python OrderedList类的实现

class OrderedList():
    def __init__(self):
        self.head = None

    def isEmpty(self):
        return self.head is None

    def length(self):
        current = self.head
        count = 0
        while current:
            count += 1
            current = current.getNext()
        return count

    def search(self, item):
        current = self.head
        found = False
        stop = False
        while current is not None and not found and not stop:
            if current.getData() == item:
                found = True
            else:
                if current.getData() > item:
                    stop = True
                else:
                    current = current.getNext()
        return found

    def add(self, item):
        current = self.head
        previous = None
        stop = False
        while current is not None and not stop:
            if current.getData() > item:
                stop = True
            else:
                previous = current
                current = current.getNext()
        temp = Node(item)
        if not previous:
            temp.setNext(self.head)
            self.head = temp
        else:
            temp.setNext(current)
            previous.setNext(temp)

    def remove(self, item):
        current = self.head
        previous = None
        found = False
        stop = False
        while current is not None and not found and not stop:
            if current.getData() == item:
                found = True
            elif current.getData() > item:
                stop = True
                break
            else:
                previous = current
                current = current.getNext()
        if stop:
            return print('The linked list does not have this value:{}'.format(item))
        if not previous:
            self.head = current.getNext()
        else:
            previous.setNext(current.getNext())

    def traverse(self):
        current = self.head
        while current:
            print(current.getData())
            current = current.getNext()

复杂度总结

isEmpty复杂度O(1),因为仅需检查head是否为None
length复杂度为O(n),需要遍历整个链表
search/remove以及有序链表的add方法，复杂度为O(n),无序链表的add方法为O(1)

测试用例

mylist = OrderedList()
mylist.add(31)
mylist.add(77)
mylist.add(17)
mylist.add(93)
mylist.add(26)
mylist.add(54)
mylist.remove(54)
mylist.remove(54)
print(mylist.isEmpty())
print(mylist.length())
print(mylist.search(93))
print(mylist.search(100))
mylist.traverse()

输出

The linked list does not have this value:54
False
5
True
False
17
26
31
77
93