链表

//定义结点，结点分为数据域和指针域两部分

public class Node {

// 数据域
public int data;
// 指针域
public Node next;


public Node(int value) {
this.data = value;
}


public void display() {
System.out.println(data + " ");
}

}

/**
 * 
 * 链表，就像一辆火车
 *
 */
public class LinkList {
public Node first;


// 插入一个节点，在头结点后进行插入
public void insertFirst(int value) {
Node node = new Node(value);
node.next = first;
first = node;
}


// 删除一个节点，在头节点后进行删除
public Node deleteFirst() {
Node temp = first;
first = temp.next;
return temp;
}


// 显示方法
public void display() {
Node current = first;
while (current != null) {
current.display();
current = current.next;
}
}


// 查找方法
public Node find(int value) {
Node current = first;
while (current.data != value) {
if (current.next == null) {
System.out.println("查找不到");
return null;
}
current = current.next;


}
return current;
}


// 删除方法，根据数据域进行删除
public Node delete(int value) {
Node current = first;
Node previous = first;
while (current.data != value) {
if (current.next == null) {
System.out.println("查找不到");
return null;
}
previous = current;
current = current.next;
}
if (current == first) {
first = first.next;
} else {
previous.next = current.next;
}
return current;
}

}

//测试类

public class Test {
public static void main(String[] args) {
LinkList linkList=new LinkList();
linkList.insertFirst(35);
linkList.insertFirst(25);
linkList.insertFirst(30);
linkList.insertFirst(16);
linkList.display();
System.out.println("------------------");
linkList.deleteFirst();
linkList.display();
System.out.println("查找方法:");
Node n=linkList.find(25);
n.display();
System.out.println("删除的显示：");
Node n1=linkList.delete(25);
n1.display();
System.out.println("删除过后的显示：");
linkList.display();
}
}