/**
* 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 null;
}
ListNode p=head;
int n=1;
while(p.next!=null){
p=p.next;
++n;
} //n=5
p.next=head;
k=k%n; //k=2
k=n-k; //k=3
int temp=0;
p=head;
while(temp<k-1){
p=p.next;
++temp;
} //temp指着3
ListNode ans=p.next;
p.next=null;
return ans;
}
}
2021-04-26(61. 旋转链表)
最新推荐文章于 2024-03-19 08:30:00 发布