旋转链表

旋转链表

题目: 给定一个链表，旋转链表，将链表每个节点向右移动 k 个位置，其中 k 是非负数。

示例 1:

输入: 1->2->3->4->5->NULL, k = 2
输出: 4->5->1->2->3->NULL
解释:
向右旋转 1 步: 5->1->2->3->4->NULL
向右旋转 2 步: 4->5->1->2->3->NULL
示例 2:

输入: 0->1->2->NULL, k = 4
输出: 2->0->1->NULL
解释:
向右旋转 1 步: 2->0->1->NULL
向右旋转 2 步: 1->2->0->NULL
向右旋转 3 步: 0->1->2->NULL
向右旋转 4 步: 2->0->1->NULL

解题思路: 先求出链表长度len, 然后求得k%len作为实际旋转次数, 将尾节点和头节点相连, 从头节点开始找到第len-k个节点, 这就是旋转后的尾节点, 将该节点next置为null

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head == null || head.next == null || k == 0)
            return head;
        
        int len = 0;
        ListNode p = head, pr = head;
        while(p != null) {
            len++;
            pr = p;
            p = p.next;
        }
        
        k = k % len;
        if(k == 0)
            return head;
        pr.next = head;
        p = head;
		//怎么求得len-1-k: 可以这样思考, 每旋转一次链表, 就会有一个尾节点变为头节点, k次是k个
		//那么此时原链表从右往左数第k+1个节点就是旋转后的尾节点, 也就是从左往右数的第len-k个节点
		//又因为循环时起点是链表长度的一部分所以要-1因此循环次数是len-k-1
        for(int i = 0; i < len - 1 - k; i++) {
            p = p.next;
        }
        
        head = p.next;
        p.next = null;
        return head;
    }
}

/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */

public class Solution {
    /**
     * @param head: the List
     * @param k: rotate to the right k places
     * @return: the list after rotation
     */
    public ListNode rotateRight(ListNode head, int k) {
        // write your code here

        if(head == null || head.next == null) {
            return head;
        }
        
        int len = 0;
        ListNode cur = head;
        while(cur != null) {
            cur = cur.next;
            len++;
        }

        k = k % len;
        if(k == 0) {
            return head;
        }

        ListNode root = new ListNode(0);
        root.next = head;

        ListNode fast = root, slow = root, pr = null, pr_s = null;

        for(int i = 0; i < k; i++) {
            pr = fast;
            fast = fast.next;
        }

        while(fast != null) {
            pr_s = slow;
            slow = slow.next;
            pr = fast;
            fast = fast.next;
        }

        root.next = slow;
        pr.next = head;
        pr_s.next = null;

        return root.next;

    }
}