反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
分析:
Java代码:
public class ListNode{
int val;
ListNode next;
ListNode(int x){
this.val = x;
}
}
class Solution{
public ListNode reverseList(ListNode head){
ListNode prev = null;
ListNode curr = head;
while(curr!=null){
ListNode next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}
}