# 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:
        #这题简单！在断点切开分别进行操作就可以了
        #method2: use all the travel is ok
        cur=head
        i=1
        ls=[]

        while head: 
            ls.append(head.val)
            head=head.next
            if head==None:
                break
            i+=1
        
        new_node=ListNode(0)
        new_node_ad=new_node
　　　　　#这里需要注意，因为旋转的次数k，可能比整个链表的长度还长，因此需要做取余的处理
        if k>i:
            k=k%i
        ls_after=ls[(len(ls)-k):]
        ls_new=ls_after+ls[:len(ls)-k]

        for i in ls_new:
            new_node.next=ListNode(i)
            new_node=new_node.next
        return new_node_ad.next