链表

1.构建节点类

2.构建链表类

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



class SingleLinkList(object):
    """链表"""
    
    def __init__(self, node=None):
        self.__head = node
    


    def is_empty(self):
        """判断是否为空"""
        return self._head ==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)
            cur = cur.next
        
        
    
    def add(self, item):
        """在链表头部添加元素"""
        node = Node(item)
        node.next = self.__head
        self.__head = node

    def append(self, item):
        """在链表尾部添加元素"""
        node = Node(item)
        cur = self._head
        if self.is_empty():
            self._head = node
        else:
            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 - 1:
            self.append(item)
        else:
            node = Node(item)
            cur = self.__head
            i = 0
            while i < (pos-1):
                cur = cur.next
                i += 1
            node.next = cur.next
            cur.next = node
        

    def remove(self, item):
        """删除节点"""
        
        cur = self.__head
        pre = None

        while cur != None:
            if cur.elemt == item:
                if cur == self.__head:
                    self.__head == cur.next
                    break
                else:
                    pre.next = cur.next
                    break
            else:
                pre = cur
                cur = cur.next
                
        

    def search(self, item):
        """查找节点是否存在"""
        cur = self.__head
        while cur != None:
            if cur.elemt == item:
                return True
            else:
                cur = cur.next
        return False
        

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值