python实现链表节点及单链表

python实现链表节点：

# coding:utf-8

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

# node = Node(100)

python实现单链表的各种操作：

# coding:utf-8

class SingleLinkList(object):
	"""单链表"""
	def __init__(self, node=None):
		"""定义头节点"""
		self._head = node

	def is_empty(self):
		"""链表判空"""
		return self._head == None

	def length(self):
		"""链表长度"""
		# cur为游标，用来移动遍历节点
		cur = self._head
		# count记录数量
		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=" ")     #end=""是不用换行
			cur = cur.next
		print("")

	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):
		"""指定位置添加某一元素
		:param pos从0开始
		"""
		if pos <= 0:
            self.add(item)
        elif pos > (self.length()-1):
            self.append(item)
        else:
            pre = self._head
            count = 0
            while count < (pos-1):
                count += 1
                pre = pre.next
            #当循环退出后，pre指向pos-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
                return
            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