单向链表的Java实现

1、

class Node{
    private String data;
    private Node next;
    public Node(String data){
        this.data = data;
    }
    public String getData(){
        return this.data;
    }
    public void setNext(Node next){
        this.next = next;
    }
    public Node getNext(){
        return this.next;
    }
}
public class LinkDemo01 {

    public static void main(String[] args) {
        Node root = new Node("火车头");
        Node n1 = new Node("车厢A");
        Node n2 = new Node("车厢B");
        Node n3 = new Node("车厢C");
        root.setNext(n1);
        n1.setNext(n2);
        n2.setNext(n3);
        PrintNode(root);
    }

    private static void PrintNode(Node node) {
        System.out.println(node.getData() + "	");
        if(node.getNext() != null){
            PrintNode(node.getNext());
        }
    }

输出结果为：

火车头
车厢A
车厢B
车厢C

2、

class Link{
    class Node{
        private String data;
        private Node next;
        public Node(String data){
            this.data = data;
        }
        public void add(Node newNode){
            if(this.next == null){
                this.next = newNode;
            }else{
                this.next.add(newNode);
            }
        }
        public void print(){
            System.out.println(this.data + "	");
            if(this.next != null){
                this.next.print();
            }
        }
        public boolean search(String data){
            if(data.equals(this.data)){
                return true;
            }else{
                if(this.next != null){
                    return this.next.search(data);
                }else{
                    return false;
                }
            }
        }
        public void delete(Node previous,String data){
            if(data.equals(this.data)){
                previous.next = this.next;
            }else{
                if(this.next != null){
                    this.next.delete(this, data);
                }
            }
        }
    }
    private Node root;
    public void addNode(String data){
        Node newNode = new Node(data);
        if(this.root == null){
            this.root = newNode;
        }else{
            this.root.add(newNode);
        }
    }
    public void printNode(){
        if(this.root != null){
            this.root.print();
        }
    }
    public boolean contain(String name){
        return this.root.search(name);
    }
    public void deletNode(String data){
        if(this.contain(data)){
            if(this.root.data.equals(data)){
                this.root = this.root.next;
            }else{
                this.root.next.delete(root, data);
            }
        }
    }
}

public class LingDemo02 {

    public static void main(String[] args) {
        Link l = new Link();
        l.addNode("A");
        l.addNode("B");
        l.addNode("C");
        l.addNode("D");
        l.addNode("E");
        
        l.printNode();
        
        l.deletNode("C");
        
        System.out.println();
        
        l.printNode();
        
        System.out.println();
        
        System.out.println(l.contain("A"));
        
    }

}

输出结果为：

A
B
C
D
E

A
B
D
E

true