LeetCode-61 Rotate List

Description

Given a linked list, rotate the list to the right by k places, where k is non-negative.

Example

Example 1:
Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL

Example 2:
Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

Submissions

解题思路是首先遍历得到链表长度length，然后根据给定的k得到切割点的位置,因为是从右旋转k个单位，因此是从左起length-k个单位，因此找到新定义的尾结点为length-k-1位置，即pre。最后调整链表，将pre指向None,pre.next为新链表的起点，之前的尾结点tail连接之前的head。最后返回新链表即可。

实现代码如下：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def rotateRight(self, head: ListNode, k: int) -> ListNode:
        if head == None or head.next == None or k == 0:
            return head
        length, tail = 1, head
        while tail.next:
            tail = tail.next
            length+=1        
        k = k % length
        if k == 0:
            return head
            
        pre = head
        for _ in range(length-k-1):
            pre = pre.next
        newhead = pre.next
        tail.next = head
        pre.next = None
        
        return newhead

参考