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;
}
}
|
java 反转链表
最新推荐文章于 2024-06-19 22:00:01 发布