class Solution {
public ListNode reverseList(ListNode head) {//反转链表
ListNode prev = null;
ListNode curr = head;
while (curr != null) {
ListNode nextTemp = curr.next;
curr.next = prev;
prev = curr;
curr = nextTemp;
}
return prev;
}
}
反转链表
最新推荐文章于 2024-06-14 09:15:00 发布