/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
if(head == null) {
return null;
}
ListNode dummy = new ListNode(-1);
dummy.next = head;
ListNode pre = dummy.next;
ListNode pCur = pre.next;
while(pCur != null){
pre.next = pCur.next;
pCur.next = dummy.next;
dummy.next = pCur;
pCur = pre.next;
}
return dummy.next;
}
}
算法系列------反转链表
最新推荐文章于 2024-07-10 21:17:12 发布