数据结构用python实现简单算法

1.使用前插法创建单链表

# 1.定义单链表的模具
class Node():
    def __init__(self,date = 0):
        self.date = date
        self.next = None
# 2.前插法构造单链表
head = Node()
head.date = -1
head.next = None
for i in range(5):
    q = Node()
    q.date = i+1
    q.next = None
    q.next = head.next
    head.naxt = q

2.使用尾插法创建单链表

# 1.定义单链表模具
class Node():
    def __init__(self,date = 0):
        self.date = date
        self.next = None
# 2.尾插法构造单链表
head = Node()
head.date = -1
head.next = None

#（1）克隆新结点q
for i in range(5):
    q = Node()
    q.date = i+1
    q.next = None
#（2）修改指针，找到当前单链表的尾结点
    p = head
    while p.next != None:
        p = p.next
        p.next = q

 3.打印单链表中的每一个元素

p = head
while p != None:
    p = p.next
    print('节点的数据是%s' %p.date)

4.第i个节点前插入新的节点

p = head
for k in range(i):
    count = 0        # 计数，用来计算位置
    while count < i: # 查找插入位置
        p = p.next
        count += 1   # 计数器计数
q = Node()
q.next = p.next
p.next = q

注意：代码仅供参考（水平有限）