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