Python数据结构第三天

线性表：
顺序表和链表

链表：
将元素放在通过连接构造起来的一系列存储块中，一个存储单位包括数据区和链接区，链接区保存的是下一个数据的地址，尾节点的链接区指向空
链表只记录头节点，想找其他节点必须要从头遍历
在系统没法一次性分配连续大空间，链表可以将分散的小空间使用起来，但链表中每一个结点需要的空间都更大

单链表：

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

class SingleLinkList(self):
	"""单链表"""
	def __init__(self, node):
		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游标，用来移动遍历节点
		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)
		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):
		"""在指定的位置添加元素"""
		# pos 指定位置，从0开始索引
		node = Node(item)
		if pos <= 0:
			self.add(item)
		elif pos > (self.length() - 1):
			self.append(item)
		else:
			cur = self.__head
			count = 0
			# 循环结束，cur指向pos上一个节点
			while count < (pos - 1):
				count += 1
				cur = cur.next
			node.next = cur.next
			cur.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

node = Node(100)
single_obj = SingleLinkList(node)
single_obj.travel()

双向链表：
分为前驱节点，数据区，后继节点

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

class DoubleLinkList(self):
	"""双链表"""
	def __init__(self, node):
		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游标，用来移动遍历节点
		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
		node.next.prev = node
		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
			node.prev = cur
		
	def insert(self, pos, item):
		"""在指定的位置添加元素"""
		# pos 指定位置，从0开始索引
		node = Node(item)
		if pos <= 0:
			self.add(item)
		elif pos > (self.length() - 1):
			self.append(item)
		else:
			cur = self.__head
			count = 0
			# 循环结束，cur指向pos上一个节点
			while count < pos:
				count += 1
				cur = cur.next
			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
					# 判断链表是否只有一个节点
					if cur.next:
						cur.next.prev = None
				else:
					cur.prev.next = cur.next
					if cur.next:
						cur.next.prev = cur.prev
				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__":
	dll = DoubleLinkList()