/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode p1=null;
ListNode p2=head;
while(p2!=null){
ListNode next = p2.next;
p2.next=p1;
p1=p2;
p2=next;
}
return p1;
}
}
2022-01-12(剑指 Offer 24. 反转链表)
最新推荐文章于 2024-10-17 16:33:41 发布