输入一个链表,反转链表后,输出新链表的表头。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode pre = null;
while(head != null){
ListNode t = head.next;
head.next = pre;
pre = head;
head = t;
}
return pre;
}
}