翻转链表与全排列

最新推荐文章于 2024-07-08 00:01:13 发布

Dream visit

最新推荐文章于 2024-07-08 00:01:13 发布

阅读量403

点赞数 15

分类专栏：算法文章标签：链表 python 算法

本文链接：https://blog.csdn.net/dreamnn/article/details/136919939

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

翻转链表

输入：1->2->3->4
输出：4->3->2->1
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
def ReverseList(head):
	cur = head
	p = cur.next
	cur.next = None  #这一步十分关键，总是忘记，导致无法通过，需要把头节点的next节点指向空
	while p:
		q = p.next
		p.next = cur
		cur = p
		p = q
	return cur

全排列

使用回溯，五部曲
def backtracking(nums, res, path, visited):
	if len(path) == len(nums):	# 终止条件
		res.append(path[:])
		return 
	for i in range(len(nums)):
		if visited[i] == 0:
			visited[i] = 1
			path.append(nums[i])
			backtracking(nums, res, path, visited)
			path.pop()	# 回溯
			visited[i] = 0

nums = [1, 2, 3, 4]
res = []
path = []
visited = [0] * len(nums)
backtracking(nums, res, path, visited)