题目描述
输入一个链表,反转链表后,输出链表的所有元素
/*
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||head.next==null) {
return head;
}
ListNode midNode=head.next, preNode=head, nextNode;
head.next = null;
while (midNode.next!=null) {
nextNode = midNode.next;
midNode.next = preNode;
preNode = midNode;
midNode = nextNode;
}
midNode.next = preNode;
return midNode;
}
}