java 单向链表类

package datastructure.linklist;


public class LinkList {
	public class ListNode {
  	  public int val;
  	  public ListNode next;
  	  ListNode(int x) 
  	  { val = x; 
  	  	next=null;
  	  }
  	  public ListNode() {
  		  val=0;
  		  next=null;
  	  }
  	  
  	  public void printNodeToEnd(){
  		ListNode a=this;
		System.out.println("print node to end");
		while(a!=null){//直到最后一个不为空的节点
			System.out.print(a.val+"  ");
			a=a.next;
		}
		System.out.println();
  	  }
	}
	
	ListNode first;
	
	public LinkList(int x){
		first=new ListNode(x);
		first.next=null;
	}
	public LinkList(){
		first=null;
		first.next=null;
	}
	
	public void addLast(int x){
		
		if(first==null){
			first=new ListNode(x);
			return;
		}
		ListNode a=first;
		while(a.next!=null){
			a=a.next;
		}
		ListNode b=new ListNode(x);
		a.next=b;
	}
	
	public void printList(){
		ListNode a=first;
		System.out.println("print listnode");
		while(a!=null){//直到最后一个不为空的节点
			System.out.print(a.val+"  ");
			a=a.next;
		}
		System.out.println();
	}
	
	
	
}