Java版带头结点单链表的实现.doc

Java版带头结点单链表的实现package dsr;public interface IList public void clear();/8public boolean isEmpty();/1public int length();/2public Object get(int i)throws Exception;/3public void insert(int i,Object x)throws Exception;/4public void remove(int i) throws Exception;/7public int indexOf(Object x);/6public void display();/5package dsr; public class Node Object data;Node next;public Node()this(null,null);public Node(Object data)this(data,null);public Node(Object data,Node next)this.data=data;this.next=next;package dsr;public class LinkList implements IList public Node head; public LinkList() head =new Node(); public void insertFirst(Object data) Node link = new Node(data); link.next = head; head = link; public Node deleteFirst() Node temp = head; head = head.next; return head; public void deleteLike(Object key) Node current = head; Node privous = head; boolean isfind = true; while (current.data != key) if (current.next != null) privous = current; current = current.next; else System.out.println(no find the Data); current = null; isfind = false; break; if (isfind = true) if (current = head) head = head.next; else privous.next = current.next; else System.out.println(no find the Data of delete); public void display() System.out.println(List (fist - - last ); Node top = head; while (top != null) System.out.println( + top.data + ); top = top.next; public boolean isEmpty() return (head = null); public void clear() Node current= head; while (current!= null) if(current.next!= null) head= current.next; current=null; current=head; head=null;public Object get(int i) throws Exception if(i=0) return Sorry,can not find ; Node current = head; int currentlength=0; while (current.next!= null) currentlength+; if (currentlength=i) return current.data; current = current.next; currentlength+; if (currentlength=i) return current.data; else return Sorry,can not find ;public int indexOf(Object x) Node current = head; int index=1; while (current.data != x) if (current.next != null) index+; current = current.next; else System.out.println(没有找到数据); current = null; break; return index;public void insert(int i, Object x) throws Exception / TODO Auto-generated method stubif(icurrentlength) System.out.println(currentlength+ Sorrry can insert at position +i); public int length() / TODO Auto-generated method stub Node current = head; int length=0; if(current=null) return length; while(current!=null) length+; current=current.next; return length;public void remove(int i) throws Exception / TODO Auto-generated method stub Node current= head; Node prevous=null; int index=1; while (current!= null) if(i=1) head = current.next; current=null; else if(index=i) prevous.next = current.next; current=null; else index+; if(current.next!=null) prevous=current; current=current.next; else break; package dsr;public class TestLinkList public static void main(String args) throws Exception LinkList lA = new LinkList(); LinkList lB = new LinkList(); LinkList lC = new LinkList(); int C=1,2,3,4,5,6,7,8,9,10; int Clength=C.length; for(int i=0;iClength;i+) lC.insertFirst(Ci); for(int i=1;i0