给你一个链表的头节点 head ，旋转链表，将链表每个节点向右移动 k 个位置。

public static ListNode rotateRight(ListNode head, int k) {

    int count =1;
    int flag =0;
    if (head==null){
        return head;
    }

    ListNode temp = head;
    while (temp.next!=null){
        temp = temp.next;
        count++;
    }
    k=k%count;
    flag = count -k;
    temp.next = head;
 
    for (int i = flag;i>0;i--){
        temp = temp.next;
        head = head.next;
    }

    temp.next=null;


    return head;
}