之前写的链表的增删改查

public class Node {

class Item{

private String name;

private String num;

public Item(String name, String num) {

super();

this.name = name;

this.num = num;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public String getNum() {

return num;

}

public void setNum(String num) {

this.num = num;

}

}
private Item item;
private Node next;
public Node() {
super();
}
public Node(String name,String num,Node next){
this.item=new Item(name, num);
this.next=next;
}
public Node(Item item) {
super();
this.item = item;
}
public Item getItem() {
return item;
}
public void setItem(Item item) {
this.item = item;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
public String toString(){
return item.getName()+"===="+item.getNum();
}
public static void main(String[] args) {
Links l=new Links("gangge lianbiao ");
l.addback("wanggang", "20");
l.addback("chennan", "30");
l.addfont("laoniang", "40");
l.addfont("laodie","50");
l.addfont("yeye","60");
l.addfont("nainai", "70");
l.deleteNode(3);
l.show();

}

}

class Links{

private Node head;

private Node last;

private String Linkedname;

private Integer size=0;

public Links(String linkedname) {

super();

Linkedname = linkedname;

last=head=null;

}
public void addback(String name,String num){
if(isEmpty()){
Node node =new Node(name, num,null);
this.head=this.last=node;
size++;
}else{
Node n = new Node(name,num,null);
this.last.setNext(n);
this.last=n;
size++;
}
}
public void addfont(String name,String num){
if(isEmpty()){
this.head=this.last = new Node(name, num, null);
size++;
}else{
Node n=new Node(name, num, head);
head=n;
size++;
}
}
public void deleteNode(int i){

// Node n=head;

// while(n.getNext()!=null){

// String itemname=n.getNext().getItem().getName();

// String itemnum=n.getNext().getItem().getNum();

// if(n.getNext().getNext()==null&&itemname==name&&itemnum==num){

// n.setNext(null);

// this.last=null;

// }else{

// itemname=n.getNext().getItem().getName();

// itemnum=n.getNext().getItem().getNum();

// if(itemname==name&&itemnum==num){

// n.setNext(n.getNext().getNext());

// }

// }

//

// n=n.getNext();

// }

if(i<0||i>size){

return;

}

if(i==0){

head=head.getNext();

}else{

int n=0;

Node point=head;

Node temp=point;

for(n=0;n