题目:输入一个链表的头结点,从尾到头反过来打印每个节点的值。链表的节点定义如下
struct ListNode{
int m_nkey;
ListNode *m_pNext;
};
import java.util.Stack;
import Ds.Node;
import Ds.SinglyList;
public class Test_06 {
public static void main(String args[]){
Integer[]a={1,2,3,4,5,6};
SinglyList<Integer>list=new SinglyList<Integer>(a);
Node<Integer>head=list.head;
System.out.print("递归处理 : ");
process1(head);
System.out.println();
System.out.print("用栈处理: ");
process2(head);
}
public static void process1(Node<Integer> p){
if(p!=null){
if(p.next!=null){
process1(p.next);
}
}
if(p.data!=null){
System.out.print(p.data+" ");
}
}
public static void process2(Node<Integer>p){
Stack<Integer> stack=new Stack<Integer>();
Node<Integer>q=p.next;
while(q!=null){
stack.push(q.data);
q=q.next;
}
while(!stack.isEmpty()){
System.out.print(stack.pop()+" ");
}
}
}