class Solution {
public ListNode reverseList(ListNode head) {
ListNode cur = head;
ListNode newHead = null;
ListNode prev = null;
while (cur!=null) {
ListNode curNext = cur.next;
if (curNext==null) {
newHead = cur;
}
cur.next = prev;
prev = cur;
cur = curNext;
}
return newHead;
}
}