输入一个链表,反转链表后,输出链表的所有元素。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
import java.util.Stack;
public class Solution {
public ListNode ReverseList(ListNode head) {
if(null == head){
return null;
}else{
ListNode nhead = null;
ListNode node = null;
while(head!=null){
node = new ListNode(head.val);
node.next = nhead;<span style="white-space:pre"> </span>//头部插入,实现翻转
nhead = node;
head = head.next;
}
return nhead;
}
}
}