python实现单链表

class Node:
def init(self, val, next_=None):
self.val = val
self.next_ = next_

class LinkList:
def init(self):
self._head = None

# 判断列表是否为空
def is_empty(self):
    if self._head == None:
        return None
    return True

# 获取链表长度
def get_length(self):
    if self.is_empty() is None:
        return 0
    p = self._head
    count = 0
    while p != None:
        count += 1
        p = p.next_
    return count

# 从尾部添加节点
def append_node(self, data):
    node = Node(data)
    if self.is_empty() is None:
        self._head = node
    else:
        p = self._head
        while p.next_ != None:
            p = p.next_
        p.next_ = node

# 从头部添加节点
def add_head(self, data):
    node = Node(data)
    if self.is_empty() is None:
        self._head = node
    else:
        p = self._head
        self._head = node
        node.next_ = p

# 从特定位置添加节点
def insert_node(self, pos, data):
    if pos > self.get_length() or pos <= 0:
        print("位置不合法！")
        return
    node = Node(data)
    p = self._head
    while pos > 1:
        p = p.next_
        pos -= 1
    q = p.next_
    p.next_ = node
    node.next_ = q

# 遍历链表
def travel(self):
    lList = []
    p = self._head
    while p != None:
        lList.append(p.val)
        p = p.next_
    return lList

# 从尾部删除节点,并返回值
def delete_last(self):
    if self.is_empty() is None:
        print("空链表！")
        return
    p = self._head
    # 链表中只有一个元素
    if p.next_ == None:
        val = p.val
        self._head = None
        return val
    # 链表中有多个元素
    while p.next_.next_ != None:
        p = p.next_
    val = p.next_.val
    p.next_ = None
    return val

# 从头部删除节点,并返回值
def delete_head(self):
    if self.is_empty() is None:
        print("空链表！")
        return
    # 链表中只有一个元素
    if self._head.next_ == None:
        val = self._head.val
        self._head = None
        return val
    # 链表中有多个元素
    val = self._head.val
    self._head = self._head.next_
    return val

# 删除指定位置的节点，并返回值
def delete_pos(self, pos):
    if self.is_empty() is None:
        print("空链表！")
        return
    if pos > self.get_length() or pos <= 0:
        print("位置不合法！")
        return
    p = self._head
    while pos > 1:
        p = p.next_
        pos -= 1
    val = p.next_.val
    p.next_ = p.next_.next_
    return val

# 修改特定节点的值
def alter_val(self, pos, data):
    if self.is_empty() is None:
        print("空链表！")
        return
    if pos > self.get_length() or pos < 0:
        print("位置不合法！")
        return
    if pos == 0:
        self._head.val = data
        return
    p = self._head
    while pos:
        p = p.next_
        pos -= 1
    p.val = data

# 查找特定位置的节点并返回值
def search_pos(self, pos):
    if self.is_empty() is None:
        print("空链表！")
        return
    if pos > self.get_length() or pos < 0:
        print("位置不合法！")
        return
    if pos == 0:
        return self._head.val
    else:
        p = self._head
        while pos:
            p = p.next_
            pos -= 1
        return p.val

# 查找特定值的节点，并返回位置
def search_val(self, val):
    if self.is_empty() is None:
        return "空链表！"
    f = []
    pos = 0
    fg = 1
    p = self._head
    while p:
        if p.val == val:
            fg = 0
            f.append(pos)
        p = p.next_
        pos += 1
    if fg:
        return '链表中查无此值!'
    else:
        return f