LeetCode 61. Rotating linked list

原题网址：https://leetcode.cn/problems/rotate-list/

Give a linked list head node,给一个值k,Let the linked list rotate clockwisek次;

1-2-3-4;k=2
3-4-1-2;
In fact, it is to find the last little bit.俩表长度-k%链表长度

    public ListNode rotateRight(ListNode head, int k) {
    
        if(head == null) {
    
            return head;
        }

        int size = 0;
        ListNode node = head;
        ListNode tail = null;
        // Find the trailing node and length
        while(node != null) {
    
            size++;
            if(node.next == null) {
    
                tail = node;
            }
            node = node.next;
      
        }
        tail.next = head;

        k = k%size;
        node = head;
        // 要转k次.I was looking for it beforesize-k-1的节点.
        int tmp = size-k-1;
        while(tmp>0) {
    
            node = node.next;
            tmp--;
        }
        ListNode next = node.next;
        node.next = null;
        return next;




    }