LeetCode:61.旋转链表

给定一个链表，旋转链表，将链表每个节点向右移动 k 个位置，其中 k 是非负数。

示例 1:

输入: 1->2->3->4->5->NULL, k = 2
输出: 4->5->1->2->3->NULL

解法

首先把尾巴和头部连在一起，顺便求出总长leng，leng - k % leng 就是新的链表的头部位置

# 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 not head:
            return head
        p = head
        leng = 1
        while p.next:
            leng += 1
            p = p.next
        p.next = head #形成环
        k = k % leng
        prev = None
        p = head
        for _ in range(leng-k):
            prev = p
            p = p.next
        prev.next = None
        return p