题目描述:
思路:pre更新到当前curr,当前cur往下移动一个。cur.next指向pre
需要存储next
代码:
class Solution {
public ListNode reverseList(ListNode head) {
ListNode prev=null;
ListNode curr=head;
while (curr!=null){
ListNode next = curr.next;
curr.next=prev;
prev=curr;
curr=next;
}
return prev;
}
}