LeetCode 61. Rotate List

Given a linked list, rotate the list to the right by k places, where k is non-negative.

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

其实把后K个元素给提到前面去

public static ListNode rotateRight(ListNode head, int k) {
        if (head == null || head.next == null || k == 0)
            return head;

        ListNode tail = head;
        int length = 1;
        while (tail.next != null) {
            length++; // 计算链表长度
            tail = tail.next; // 标记末尾节点
        }
			
        System.out.println(tail.val);// 此时tail指向最后一个元素
        int loop = k % length; 
        if(loop == 0)	// 此时链表相当于不变
            return head;

        ListNode oldTail = head; 
        for (int i = 0; i < length - loop - 1; i++) {// 找倒数第k个节点
            oldTail = oldTail.next;
        }
        System.out.println(oldTail.val); // 此时oldTail指向第(length-loop)个元素

        ListNode newHead = oldTail.next;
        tail.next = head; //首尾相连，此时为循环链表
        oldTail.next = null; // 断开分隔处

        return newHead;
    }