数据结构之单向链表（java实现）

定义节点

/*
 * 节点类
 * 
 */
public class Node {
    Object data;//存储节点数据
    Node next;//指向下一节点
}

定义操作

public interface LinKed {

    public Node get(int p);

    public void Insert(int p, Object data);

    public void delete(int p);

    public void clean();

    public int size();

}

实现单向链表

public class SingleLinked implements LinKed {
    private Node head;// 头节点
    private int length;// 链表长度
    /*
     * 初始化链表
     */

    public SingleLinked() {
        head = null;
        length = 0;
    }

    /*
     * 清空链表
     */
    public void clean() {
        head = null;
        length = 0;
    }

    /*
     * 获取链表第p个节点
     */
    public Node get(int p) {
        Node current = head;
        if (p > 0 && p <= length) {
            for (int i = 0; i < p - 1; i++) {
                current = current.next;
            }
            return current;
        }
        return null;

    }

    /*
     * 插入节点头插法
     */
    public void headInsert(Object data) {
        Node n = new Node();
        n.data = data;
        n.next = head;
        head = n;
        length++;

    }

    /*
     * 插入节点在p节点
     */
    public void Insert(int p, Object data) {
        Node current = head;
        Node n = new Node();
        n.data = data;
        if (p > 0 && p <= length + 1) {

            for (int i = 0; i < p - 2; i++) {

                current = current.next;
            }

            n.next = current.next;
            current.next = n;
            length++;

        }

    }

    /*
     * 删除第p个节点
     */
    public void delete(int p) {
        Node current = head;

        // 遍历链表直到p节点的前一节点
        if (p > 0 && p <= length) {
            if (p == 1) {// 若删除的是头节点
                head = current.next;
                length--;
                return;
            } else {
                for (int i = 1; i <= p; i++) {

                    if (i == p - 1) {
                        current.next = current.next.next;
                        length--;
                    } else {
                        current = current.next;
                    }

                }
            }

        }
    }

    /*
     * 打印链表
     */
    public void print() {
        Node current = head;
        for (int i = 0; i < length; i++) {
            System.out.print(current.data + "-->");
            current = current.next;
        }
        System.out.println();
    }

    @Override
    public int size() {

        return this.length;
    }

}

测试

public class Test {

    public static void main(String[] args) {
        SingleLinked sl = new SingleLinked();
        sl.headInsert("a1");
        sl.headInsert("a2");
        sl.headInsert("a3");
        sl.headInsert("a4");
        sl.print();
        sl.delete(4);
        sl.print();
        System.out.println(sl.get(3).data);
        sl.Insert(4, "a5");
        sl.print();
        sl.Insert(2, "a6");
        sl.print();

    }

}