61. 旋转链表

void1024

于 2024-07-14 04:26:00 发布

阅读量18

点赞数

分类专栏：面试经典 150 题文章标签：链表 java 算法

本文链接：https://blog.csdn.net/diOSyu/article/details/140410943

版权

面试经典 150 题专栏收录该内容

102 篇文章 1 订阅

订阅专栏

class Solution {
    ListNode tail = null;

    public int getLen(ListNode head) {
        int len = 0;
        while (head != null) {
            len++;
            tail = head;
            head = head.next;
        }
        return len;
    }

    public ListNode rotateRight(ListNode head, int k) {
        int len = getLen(head);
        if (len < 2) {
            return head;
        }
        k %= len;
        if (k == 0) {
            return head;
        }
        int lk = len - k;
        ListNode root = new ListNode(), p = root, q = null, r= null;
        root.next = head;
        int i = 0;
        while (i < lk) {
            p = p.next;
            i++;
        }
        q = p.next;
        p.next = null;
        r = root.next;
        root.next = q;
        tail.next = r;
        return root.next;
    }
}