class Node(object):
"""节点"""
def __init__(self,elem):
self.elem = elem
self.next = None
class SingeLinkList(object):
"""单链表以下对象方法"""
def __init__(self,node = None):
self._head = node
def is_empty(self):
return self._head == None
#self作为对象属性,self必传
def length(self):
#cur用来移动,遍历节点
#count用来计数
cur = self._head
count = 0
#cur = None
#cur.next = None
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
pass
def add(self,item):
pass
def append(self,item):
#构造函数把数据存为节点,就有了节点
node = Node(item)
if self.is_empty():
self._head = node
else:
cur = self._head
while cur.next != None:
# 让新节点指向尾结点的next区
cur = cur.next
# 节点指向尾结点(尾结点就是新插入的节点)结束循环
cur.next = node
pass
def insert(self,pos,item):
pass
def remove(self,item):
pass
def search(self,item):
pass
if __name__ == '__main__':
ll = SingeLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(1)
print(ll.is_empty())
print(ll.length())
ll.append(2)
ll.append(3)
ll.append(4)
ll.append(5)
ll.travel()
#node = Node(100)
#single_object为一个链表对象
#single_object = SingeLinkList(node)
# single_object = SingeLinkList(node)
# single_object.append()
# class Student(object):
# # self就是一个对象,对象里面有两个参数self.name,self.male
# def __init__(self,name,male):
# self.name = name
# self.male = male
# def intr(self):
# sen = "i am " + self.name
# return sen
# stu = Student("liusiyan","female")
#stu代表一个实例
# print(stu.intr())
# print(student.name)
Python数据结构与算法03——单链表、双链表、单项循环链表_哔哩哔哩_bilibilihttps://www.bilibili.com/video/BV1nK4y1v7uv?p=5