funcrotateRight(head *ListNode, k int)*ListNode {if k ==0|| head ==nil{return head
}
listLength :=0for node := head; node !=nil; node = node.Next {
listLength++}
kk := k % listLength
if kk ==0{return head
}
cur := head
for i:=1; i< listLength-kk; i++{
cur = cur.Next
}
newHead := cur.Next
node := newHead
for; node.Next !=nil; node= node.Next{}
node.Next = head
cur.Next =nilreturn newHead
}