车厢的代码
package day_4;
/**
* 链接点:相当于(每节的)车厢
* */
public class Node {
//数据域
public long data;
//指针域
public Node next;
public Node (long value) {
this.data = value;
}
//显示方法
public void display() {
System.out.print(data + " ");
}
}
火车的代码
package day_4;
/**
* 链表,相当于火车(把车厢串联起来)
* */
public class LinkList {
//头结点
private Node first;
public LinkList() {
first = null;
}
/**
* 插入一个结点,在头部结点后进行插入
* */
public void insertFirst(long value) {
Node node = new Node(value);
node.next = first;
first = node;
}
/**
* 删除一个结点,在头结点后进行删除
* */
public Node deleteFirst() {
Node tmp = first;
first = tmp.next;
return tmp;
}
/**
* 显示方法
* */
public void display() {
Node current = first;
while(current != null){
current.display();
current = current.next;
}
}
/**
* 查找方法
* */
public Node find(long value) {
Node current = first;
while(current.data != value) {
if(current == null) {
return null;
}
current = current.next;
}
return current;
}
/**
* 删除方法 根据数据域来进行删除
* */
public Node delete(long value) {
Node current = first;
Node previous = first;
while(current.data != value) {
if(current.next == null) {
return null;
}
previous = current;
current = current.next;
}
if(current == first) {
first = first.next;
}else {
previous.next = current.next;
}
return current;
}
}
测试的代码:
package day_4;
public class TestLinkList {
public static void main(String[] args) {
// TODO Auto-generated method stub
LinkList ll = new LinkList();
ll.insertFirst(34);
ll.insertFirst(23);
ll.insertFirst(12);
ll.insertFirst(5);
ll.insertFirst(-1);
ll.display();
System.out.println("======");
ll.deleteFirst();
ll.display();
System.out.println("======");
// Node node = ll.find(23);//查找这个23 显示出23
// node.display();
// System.out.println("======");
// Node node1 = ll.delete(5);
// node1.display();
// System.out.println("======");
// ll.display();
}
}