/*
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 newHead =
null
;
ListNode pNode = head;
ListNode pPrev =
null
;
while
(pNode!=
null
){
ListNode pNext = pNode.next;
if
(pNext==
null
)
newHead = pNode;
pNode.next = pPrev;
pPrev = pNode;
pNode = pNext;
}
return
newHead;
}
}
|
输入一个链表,反转链表后,输出链表的所有元素。
猜你喜欢
转载自blog.csdn.net/boguesfei/article/details/80654782
今日推荐
周排行