赵二的刷题日记019《反转k位链表》

月神2019

于 2021-07-10 19:25:51 发布

阅读量87

点赞数

分类专栏： LeetCode 文章标签：链表 java 算法

本文链接：https://blog.csdn.net/qq_20013333/article/details/118639411

版权

本文记录了赵二解决《反转k位链表》问题的过程，通过Java编程实现链表的右移k位操作。例子展示了如何将链表进行有效转换。

摘要由CSDN通过智能技术生成

Rotate List

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

Example 1:

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

Example 2:

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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode rotateRigh