题目描述
输入一个链表,反转链表后,输出新链表的表头。
代码
/*
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 null;
ListNode prehead=null;
ListNode nexthead=null;
while(head!=null){
nexthead=head.next;
head.next=prehead;
prehead=head;
head=nexthead;
}
return prehead;
}
}