题目描述
输入一个链表,反转链表后,输出链表的所有元素。
/**
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head==null) return head;
ListNode before=null;
ListNode node=head;
ListNode after=null;
while(node!=null){
after=node.next;
node.next=before;
before=node;
node=after;
}
return before;
}
}