1–>2–>3–>4–>5–>NULL
5–>4–>3–>2–>1–>NULL
class ListNode{
int val;
ListNode next;
ListNode(int x){
val = x;
}
}
public class ReverseList {
public ListNode reverse(ListNode head){
ListNode pre = null;
ListNode cur = head;
while (cur != null){
ListNode next = cur.next;
cur.next = pre;
pre = cur;
cur = next;
}
return pre;
}
}