LeetCode 61. Rotate List (Java版; Medium)

LeetCode Top Interview Questions 61. Rotate List (Java版; Medium)

题目描述

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个节点放到开头; 注释很详细, 取模还挺关键; 考察定位到指定的节点处

//大体的效果: 将链表的后k个节点放到开头
class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head==null || head.next==null)
            return head;
        //统计链表长度
        int n=0;
        ListNode cur=head;
        while(cur!=null){
            n++;
            cur = cur.next;
        }
        k = k%n;
        //小小的优化
        if(k==0)
            return head;
        //定位到倒数第k+1个节点
        ListNode left=head, right=head;
        //right先往前走k步,这样从left走到right共有k+1个节点
        for(int i=0; i<k; i++){
            right = right.next;
        }
        //left和right一起走, 当right走到最后一个节点时, left就是倒数第k+1个节点
        while(right.next!=null){
            left = left.next;
            right = right.next;
        }
        //改变链表结构
        right.next = head;
        head = left.next;
        left.next=null;
        return head;
    }
}