Reverse a singly linked list.
class Solution {
public ListNode reverseList(ListNode head) {
ListNode node = head;
ListNode prev = null;
while(node != null){
ListNode next = node.next;
node.next = prev;
prev = node;
node = next;
}
return prev;
}
}
public ListNode reverseList(ListNode head) {
ListNode node = head;
ListNode prev = null;
while(node != null){
ListNode next = node.next;
node.next = prev;
prev = node;
node = next;
}
return prev;
}
}