# 0061. Rotate List

<https://leetcode.com/problems/rotate-list>

## Description

Given the `head` of a linked list, rotate the list to the right by `k` places.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg)

```
**Input:** head = [1,2,3,4,5], k = 2
**Output:** [4,5,1,2,3]
```

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/11/13/roate2.jpg)

```
**Input:** head = [0,1,2], k = 4
**Output:** [2,0,1]
```

**Constraints:**

* The number of nodes in the list is in the range `[0, 500]`.
* `-100 <= Node.val <= 100`
* `0 <= k <= 2 * 109`

## ac

```java
/**
 * 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) {
        // edge case
        if (head == null || head.next == null || k < 1) return head;

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

        ListNode fast = head, slow = dummy;
        int step = 1;
        while (fast.next != null) {
            if (step >= k) slow = slow.next;
            fast = fast.next;
            step++;
        }
        // edge case
        if (step == k || k % step == 0) return head;
        if (step < k) {
            int diff = step - k % step;
            slow = dummy;
            while (diff > 0) {
                slow = slow.next;
                diff--;
            }
        }

        dummy.next = slow.next;
        slow.next = null;
        fast.next = head;

        return dummy.next;
    }
}
// fast, slow. fast reach tail,fast-> head, slow->null
// this question is stupid.... you don't need two pointers, it's slower and tedious....
```

```java
/**
 * 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) return head;
        ListNode dummy = new ListNode(0);
        dummy.next = head;

        // get length
        int len = 1;
        ListNode r1 = head;
        while (r1.next != null) {
            r1 = r1.next;
            len++;
        }

        // get cut point
        ListNode r2 = dummy;
        for (int i = len - k % len; i > 0; i--) {
            r2 = r2.next;
        }

        // reconnect
        r1.next = head;
        dummy.next = r2.next;
        r2.next = null;

        return dummy.next;
    }
}

/*
when k > size, k = k % size. find size, find k point, reconnect.
*/
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jaywin.gitbook.io/leetcode/solutions/0061-rotate-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.