[Leetcode]旋转链表
题目描述
给定一个链表,旋转链表,将链表每个节点向右移动 k 个位置,其中 k 是非负数。
示例 1:
输入: 1->2->3->4->5->NULL, k = 2
输出: 4->5->1->2->3->NULL
解释:
向右旋转 1 步: 5->1->2->3->4->NULL
向右旋转 2 步: 4->5->1->2->3->NULL
示例 2:
输入: 0->1->2->NULL, k = 4
输出: 2->0->1->NULL
解释:
向右旋转 1 步: 2->0->1->NULL
向右旋转 2 步: 1->2->0->NULL
向右旋转 3 步: 0->1->2->NULL
向右旋转 4 步: 2->0->1->NULL
解题思路
- 闭环+断链
- 闭环后旋转k次后的头结点 为 初始链表的倒数第k个节点,题目转换为寻找链表中倒数第k个节点问题
实现代码
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def rotateRight(self, head: ListNode, k: int) -> ListNode:
if head == None:
return head
tail = head
count = 1
while tail.next != None:
tail = tail.next
count += 1
tail.next = head
k = k % count
fast = head
low = head
for i in range(k + 1):
fast = fast.next
while fast != tail:
fast = fast.next
low = low.next
low = low.next
head = low.next
low.next = None
return head