链表逆序

最新推荐文章于 2023-03-22 17:07:44 发布

我是猪行不

最新推荐文章于 2023-03-22 17:07:44 发布

阅读量108

点赞数

分类专栏：面试题算法

本文链接：https://blog.csdn.net/weixin_42694291/article/details/84554817

版权

面试题算法专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#空间换时间
# def Reverse(preList):
# 	nextList = []

# 	for i in range(0, len(preList)):
# 		nextList.append(preList.pop())

# 	print(nextList)

# a = ['head', 1,2,3,6,8,4,9,7,5]

# Reverse(a)

#链表的交换
def Reverse1(preList):
	for i in range(0, int(len(preList)/2)):
		print(i)
		print('第%d次逆序：'%i)
		print(preList)
		preList[i], preList[-(i + 1)] = preList[- i - 1], preList[i]
	print("链表逆序后：")
	print(preList)

b = ['head', 1,2,3,6,8,4,9,7,5]
Reverse1(b)