首页 > 代码库 > python 链表

python 链表

2024-10-10 09:15:39   215人阅读

在C/C++中，通常采用“指针+结构体”来实现链表；而在Python中，则可以采用“引用+类”来实现链表。

 

节点类：

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

链表类：

class Linkedlist:
    def __init__(self):
        self.head = None
        self.tail = None
link_list = LinkedList()
def is_empty(self):
    return self.head is None
def append(self, data):
    node = Node(data)
    if self.head is None:
        self.head = node
        self.tail = node
    else:
        self.tail.next = node
        self.tail =node
def iter(self):
    if not iter.head:
        return
    cur = self.head
　　 yield cur.data
while cur.next: 
    cur = cur.next 
    yield cur.data
#先判断是不是空链表，yield head.data 再用while循环遍历

链表的头结点head 和 尾节点tail 都属于node

def insert(self, idx, value):
    cur = self.head
    cur_idx = 0
    if cur is None:
        raise Exception(‘That list is and empty list!‘)
    while cur_idx < idx-1:
        cur = cur.next
        if cur is None:
            raise Exception(‘List length less than index!‘)
        cur_idx += 1
    node = Node(value)
    node.next = cur.next
    cur.next = node
    if node.next is None:
        self.tail = node

 

def remove(self, idx):
    cur = self.head
    cur_idx = 0
    #空指针
    if self.head = None:
        raise Exception(‘This is an empty list‘)
    while cur_idx < idx-1:
        cur = cur.next
        #给出的索引大于链表的长度
        if cur is None:
            raise Exception(‘list length less than index‘)
        cur_idx +=1
    if idx == 0:    #当删除第一个节点时
        self.head = cur.next
        cur = cur.next
        return
    if self.head is self.tail: #当只有一个节点时
        self.head = None
        self.tail = None
        return
    cur.next = cur.next.next
    if cur.next is None:    #当删除最后一个节点时
        self.tail = cur
        
def size(self):
    i = 0
    cur = self.head
    if current is None:
        return ‘The list is an empty list‘
    while cur.next is not None:
        i +=1
        cur = cur.next
    return i
def search(self, item):
    current = self.head
    found = False
    while current is not None and not found:
        if current.data =http://www.mamicode.com/= item:
            found = True
        else:
            current = current.next 
    return found

 

 

insert：先将要插入的节点的next指向之后链表的head，然后将之前链表的next指向 将要插入的节点。

 

SinCycLinkedlist类代表单向循环链表，Node类代表链表中的一个节点：

 

python 链表


联系
我们