题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode pre = null ;
ListNode cur = head ;
while(cur != null) {
ListNode nxt = cur.next ;
cur.next = pre ;
pre = cur ;
cur = nxt ;
}
return pre ;
}
}
