题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode pre = null;
ListNode cur = head;
while(cur != null){
ListNode cur_next = cur.next;
cur.next = pre;
pre = cur; //注意循环中只需要将现在节点的next变成pre就行
cur = cur_next;
}
return pre;
}
}
