java 链表的尾插法

package com.tqnsyh.liutong;



public class dl {

	/**
	 * @param args
	 */private int size;//链表大小
		private Node tail,header;//头链表
		public dl(){
			size=0;
			tail=null;
		}
		private class Node{
			
			private Object data=null;
			private Node next=null;
			
			public Node(Object data){
				this.data=data;
				}
		}
		public void add(Object node){
			Node p=new Node(node);
			if(tail==null){
				header=tail=p;//将这个指针指向头结点
				size++;
			}else{
				tail.next=p;
				tail=p;
				size++;
				
			  
			}
		}
		public int getSize(){
			
			return this.size;
		}

		public Object get(int index){
		
			  Node node=header;
		        //从头节点开始，依次向后查找
		   
		    	  for(int i=index-1;i>=0;i--)
		    		  node=node.next;
		    	  
		     return node.data;
		 
			
		}
		public void delte(int index){
			
			  Node node=header;
		      if(index==0)
		    	  tail=node.next;
		      else{
		    	  for(int i=0;i<index-1;i++)
		    		  
		    		  node=node.next;
		    		  
		    	  node.next=node.next.next;
		    	  
		    	 }
		      
		     size--; 	
			
		}
		public void modeify(int index,Object obj){
			
			  Node node=header;
		    
		    	  for(int i=0;i<index;i++){
		    		  
		    		  node=node.next;
		    		
		    	  }
		    	  
		    node.data=obj;
			
		}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		 dl link = new dl();
		  
	      
	        link.add(96);
	        link.add(91);
	        link.add(92);
	        link.add(93);
	        link.delte(1);
	        for(int i=0;i<link.getSize();i++)
	       	 System.out.println(i+"====>"+link.get(i));
	}
	}