原题: https://leetcode-cn.com/problems/rotate-list/
一、题目要求
给你一个链表的头节点 head
,旋转链表,将链表每个节点向右移动 k
个位置。
示例 1:
输入:head = [1,2,3,4,5], k = 2 输出:[4,5,1,2,3]
示例 2:
输入:head = [0,1,2], k = 4 输出:[2,0,1]
提示:
- 链表中节点的数目在范围
[0, 500]
内 -100 <= Node.val <= 100
0 <= k <= 2 * 109
二、解题
package com.leetcode.test.linklist;
public class Solution11 {
public static void main(String[] args) {
ListNode a1 = new ListNode(1);
ListNode a2 = new ListNode(2);
ListNode a3 = new ListNode(3);
ListNode a4 = new ListNode(4);
ListNode a5 = new ListNode(5);
a1.next = a2;
a2.next = a3;
a3.next = a4;
a4.next = a5;
ListNode l = rotateRight(a1, 2);
while (l != null) {
System.out.print(l.val + " ");
l = l.next;
}
}
//先将链表串成环形,然后移动头结点指针位置,然后断开尾结点的next即可
public static ListNode rotateRight(ListNode head, int k) {
if (k == 0 || head == null){
return head;
}
ListNode cur = head;
int count = 0;
int sum = 0;
//第一次遍历,将尾结点的next指向头结点
while (cur != null){
if (cur.next == null){ //尾结点
cur.next = head;
sum ++;
break;
} else {
cur = cur.next;
sum ++;
}
}
//第二次遍历,从head开始,往后遍历sum-k%sum个位置 , 删除它的next
while (count < sum-k%sum-1){
head = head.next;
count ++;
}
cur = head.next;
head.next = null;
return cur;
}
}