LeetCode刷题记77
61. 旋转链表
/**
* 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 rotateRight(ListNode head, int k) {
if (head == null) return head;
int num = 0;
ListNode tmp = head;
while (tmp != null) {
num ++;
tmp = tmp.next;
}
k = k % num;
ListNode p1 = head;
ListNode p2 = head;
while (p2.next != null) {
if (k == 0) {
p1 = p1.next;
p2 = p2.next;
} else {
k --;
p2 = p2.next;
}
}
p2.next = head;
tmp = p1.next;
p1.next = null;
return tmp;
}
}
双指针
9/5
77/150