数据结构之链表

数据结构之链表

链表

链表和顺序表都是线性表，链表优于顺序表的地方在于会像串珠子一样将元素存为实际物理地址不连续的元素，每个元素后指代下一个元素的位置类似C++指针

单向链表

每个节点包含两个域，一个信息域(元素域)与一个链接域，链接指向下一个节点，最后一个节点的链接域指向空值

单链表赋值

Python内存中，比较特殊的是赋值操作是地址关系的映射而不是实际内存空间的别名；只有Python中可以a,b=b,a；如C中必须指明类型如int后续很难更改

• 元素赋值时
  
• 函数赋值时
  

单链表操作

节点实现

// Python单链表实现
class Node(object):
    def __init__(self, elem):
        self.elem = elem
        self.next = None

class SingleLinkList(object):
    def __init__(self, node=None):
        self.__head = node //私有对象
    def is_empty(self):
        return self.__head is None
    def length(self):
        cur = self.__head //cur游标，指向node对象
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count
    def travel(self):
        cur = self.__head
        while cur != None:
            print(cur.elem, end=' ')
            cur = cur.next
    def add(self, item):
        node = Node(item)
        node.next = self.__head
        self.__head = node
    def append(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node
    def insert(self, pos, item):
        if pos < 0:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            pre = self.__head
            count = 0
            while count < pos - 1:
                pre = pre.next
                count += 1
            node = Node(item)
            node.next = pre.next
            pre.next = node
    def remove(self, item):
        cur = self.__head
        pre = None
        while cur != None:
            if cur.elem == item:
                if cur == self.__head:
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                break
            else:
                pre = cur
                cur = cur.next
    def search(self, item):
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False
if __name__ == "__main__":
    # node = Node(100)
    # single_obj = SingleLinkList(node)
    # single_obj.travel()
    ll = SingleLinkList()
    print(ll.is_empty())
    print(ll.length())
    ll.append(1)
    print(ll.is_empty())
    print(ll.length())
    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.add(8)
    ll.insert(4, 9)
    ll.remove(100)
    ll.travel()

链表和顺序表对比

双向链表

双向链表每个节点包含两个链接：一个指向前一个节点，当此节点为第一节点时指向空值；另一个指向下一个节点，当此节点为末尾节点时指向空值

双向链表操作

节点实现

class Node(object):
    def __init__(self, item):
        self.elem = item
        self.next = None
        self.prev = None

class DoubleLinkList(object):
    def __init__(self, node=None):
        self.__head = node
    def is_empty(self):
        return self.__head is None
    def length(self):
        cur = self.__head
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count
    def travel(self):
        cur = self.__head
        while cur != None:
            print(cur.elem, end=' ')
            cur = cur.next
    def add(self, item):
        node = Node(item)
        node.next = self.__head
        self.__head = node
        node.next.prev = node
    def append(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node
            node.prev = cur
    def insert(self, pos, item):
        if pos < 0:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            count = 0
            cur = self.__head
            while count < pos:
                cur = cur.next
                count += 1
            node = Node(item)
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = node
    def remove(self, item):
        cur = self.__head
        pre = None
        while cur != None:
            if cur.elem == item:
                if cur == self.__head:
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                break
            else:
                pre = cur
                cur = cur.next
    def search(self, item):
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False
if __name__ == "__main__":
    ll = DoubleLinkList()
    print(ll.is_empty())
    print(ll.length())
    ll.append(1)
    print(ll.is_empty())
    print(ll.length())
    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.add(8)
    ll.insert(4, 9)
    ll.remove(100)
    ll.travel()

单向循环链表

单向循环链表是单链表的变形，链表中最后一个节点的不再指向空值而是指向头节点

单链表操作

节点实现

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

class SingleLinkList(object):
    def __init__(self, node=None):
        self.__head = node
        if node:
            node.next = node
    def is_empty(self):
        return self.__head is None
    def length(self):
        if self.is_empty():
            return 0
        cur = self.__head
        count = 1
        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count
    def travel(self):
        if self.is_empty():
            return
        cur = self.__head
        while cur.next != self.__head:
            print(cur.elem, end=' ')
            cur = cur.next
        print(cur.elem)
    def add(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
            return
        cur = self.__head
        while cur.next != self.__head:
            cur = cur.next
        node.next = self.__head
        self.__head = node
        cur.next = self.__head
    def append(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            cur = self.__head
            while cur.next != self.__head:
                cur = cur.next
            node.next = self.__head
            cur.next = node
    def insert(self, pos, item):
        if pos <= 0:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            pre = self.__head
            count = 0
            while count < pos - 1:
                pre = pre.next
                count += 1
            node = Node(item)
            node.next = pre.next
            pre.next = node
    def remove(self, item):
        if self.is_empty():
            return
        cur = self.__head
        pre = None
        while cur.next != self.__head:
            if cur.elem == item:
                if cur == self.__head: //判断是否头节点
                    rear = self.__head
                    while rear.next != self.__head:
                        rear = rear.next
                    self.__head = cur.next
                    rear.next = self.__head
                else:
                    pre.next = cur.next
                return
            else:
                pre = cur
                cur = cur.next
        if cur.elem == item: //cur此时指向尾节点
            if cur == self.__head:
                self.__head = None //链表只有一个节点
            else:
                pre.next = cur.next
    def search(self, item):
        if self.is_empty():
            return False
        cur = self.__head
        while cur.next != self.__head:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        if cur.elem == item:
            return False
if __name__ == "__main__":
    ll = SingleLinkList()
    print(ll.is_empty())
    print(ll.length())
    ll.append(1)
    print(ll.is_empty())
    print(ll.length())
    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.add(8)
    ll.insert(4, 9)
    ll.remove(2)
    ll.travel()