public void PrintListReversing(ListNode pHead){
Stack<ListNode> nodes = new Stack<ListNode>();
ListNode p = pHead;
while(p!=null){
nodes.push(p);
p=p.next;
}
while(!nodes.isEmpty()){
p = nodes.peek();
System.out.println(p.val);
nodes.pop();
}
}
剑指offer5:从尾到头打印链表
最新推荐文章于 2022-12-10 19:14:16 发布