题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode newHead = null;
ListNode p = head, q = null;
while (p != null) {
q = p.next;
p.next = newHead;
newHead = p;
p = q;
}
return newHead;
}
}
