java数据结构-链表的实现

//链表的实现主要是由链节点不断相连而构成


class Link{//链节点
public int data;//数据项
public Link next;//引用，指向下一个链节点，初始为NULL

public Link(int d){
data=d;
next=null;
}
public void showLink(){
System.out.println("{"+data+"}");
}



}






class LinkList{//链表，只包含first
public Link first;

public void insert(int data){//插入一个链节点，总是从链首插入
Link newLink=new Link(data);
newLink.next=first;
first=newLink;

}
public Link delete(){//删除一个链节点，总是从头删除
Link tmp=first;
first=first.next;
return tmp;
}

public void show(){//显示链表
Link current=first;
while(current!=null){
current.showLink();
current=current.next;
}
}
public boolean isEmpty(){
return first==null;
}
public boolean searchKey(int key){
if(!isEmpty()){
Link current=first;
Link prior;
while(current!=null){
if(current.data==key)
return true;
else{
prior=current;
current=current.next;
}
}
return false;
}
return false;
}
public Link deleteKey(int key){
Link current=first;
Link prior=first;
Link tmp=null;
if(!isEmpty()){
while(current!=null){
if(current.data==key)
break;
else{
prior=current;
current=current.next;
}
}
}
if(current==first){
first=first.next;
}
if(current!=null){
tmp=current;
prior.next=current.next;
}
return tmp;
}
public void insertRear(int data){
Link newLink=new Link(data);
if(first==null)
first=newLink;
else{
Link current=first;

while(current.next!=null){
current=current.next;
}



current.next=newLink;
}
}


}


public class LinkListTest{
public static void main(String[] args){
LinkList  ll=new LinkList();

ll.insertRear(10);
ll.insertRear(50);
ll.insertRear(20);
ll.insertRear(30);
ll.show();
/*
ll.insert(10);
ll.insert(50);
ll.insert(20);
ll.insert(30);
ll.show();
System.out.println("-------------------------------");
ll.delete();
ll.show();
System.out.println("----------好玩---------------------");
System.out.println(ll.searchKey(20));
System.out.println(ll.deleteKey(50));
System.out.println("----------好玩---------------------");
ll.show();*/
}
}