linknodetest.java

该程序是用JAVA来实现数据结构中的链表程序！

 import java.util.Scanner;
 class Node{
              int data;
              Node next;
     public Node(){}
     public Node(int data){
     this.data=data;
     }
     public Node(int data,Node next){
     this.data=data;this.next=next;
     }
     public void  addNode(int element){
           Node newNode=new Node(element);  
           newNode.next=this.next;
           this.next=newNode;
           
            }
                   }

public class LinkNodeTest{
   Node header=new Node();
   Node header1=new Node();

   public void  Link(int n,int a[]){
       for(int i=0;i<n;i++)
    	   header.addNode(a[i]);
   
}
   public void Reverse(int n,int a[]){

	   int []b=new int[n];
	   int i=n;
	
	   while(i>0){
		   
		   header1.addNode(a[i-1]);
		   i--;
	   }
	   }
   public void display(){
   while(header.next!=null){
	     System.out.print(header.next.data+"  ");
	     header.next=header.next.next;

   }
   System.out.println();
   }
   public void display1(){
	   while(header1.next!=null){
		     System.out.print(header1.next.data+"  ");
		     header1.next=header1.next.next;

	   }
	   System.out.println();
	   
   }
   public static void main(String[] args){
   Scanner scanner=new Scanner(System.in);
   LinkNodeTest linkNode=new LinkNodeTest();
       System.out.println("please input n:");
       int n=scanner.nextInt();
       int []a=new int[n];
       System.out.println("please input numbers(the mount is n):");
       for(int i=0;i<n;i++)
          a[i]=scanner.nextInt();
       System.out.println("now begin create link table:");
       linkNode.Link(n, a);
       System.out.println("display the quondam link:");
       linkNode.display();
       System.out.println("now begin create oppsite link table:");
       linkNode.Reverse(n,a);
       System.out.println("display oppsite link table:");
       linkNode.display1();

   }
}