【LeetCode】#61旋转链表(Rotate List)

【LeetCode】#61旋转链表(Rotate List)

题目描述

给定一个链表，旋转链表，将链表每个节点向右移动 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

Description

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

Example

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

解法

class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head==null)
            return head;
        if(k==0)
            return head;
        ListNode node = head;
        int len = 0;
        while(node.next!=null){
            node = node.next;
            len++;
        }
        len++;
        node.next = head;
        // node = node.next;
        len = len-(k%len);
        for(int i=0; i<len; i++){
            node = node.next;
        }
        head = node.next;
        node.next = null;
        return head;
    }
}