题目:输入一个链表的头结点,从尾到头反过来打印出每个节点的值。
class ListNode {
int m_nKey;
ListNode m_pNext;
public ListNode() {
// TODO Auto-generated constructor stub
}
}
public class PrintLinked {
public PrintLinked() {
// TODO Auto-generated constructor stub
}
public void print(ListNode head) {
if (head != null) {
if (head.m_pNext != null) {
print(head.m_pNext);
}
System.out.println(head.m_nKey);
}
}
}