Reverse a singly linked list.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode reverseList(ListNode head) {
ListNode res = null;
while (head != null) {
ListNode temp = head.next;
head.next = res;
res = head;
head = temp;
}
return res;
}
}