请教各位大神，面试遇到链表题，给卡住了，请帮忙指点一下。

[qq_29448025]

[Defonds]

数据结构选型、增删改查接口实现 基本就是这些东西

[逗比123号]

数组在加一两个游标就可以实现。

[萧尽悠然]

//节点类
class LinkNode {
    public Object data;  //链表节点值
    public LinkNode next;  //当前节点的后节点

    public LinkNode(Object data) {//节点初始化
        this.data = data;
    }
}

//单链表类，内部方法可适当调整
class LinkList {
    public LinkNode first; // 定义一个头结点
    private int pos = 0;// 节点的位置

    public LinkList() {
        this.first = null;
    }

    // 插入一个头节点
    public void addFirstLinkNode(int data) {
        LinkNode node = new LinkNode(data);
        node.next = first;
        first = node;
    }

    // 删除一个头结点,并返回头结点
    public LinkNode deleteFirstLinkNode() {
        LinkNode tempLinkNode = first;
        first = tempLinkNode.next;
        return tempLinkNode;
    }

    // 在任意位置插入节点 在index的后面插入
    public void add(int index, int data) {
        LinkNode node = new LinkNode(data);
        LinkNode current = first;
        LinkNode previous = first;
        while (pos != index) {
            previous = current;
            current = current.next;
            pos++;
        }
        node.next = current;
        previous.next = node;
        pos = 0;
    }

    // 删除任意位置的节点
    public LinkNode deleteByPos(int index) {
        LinkNode current = first;
        LinkNode previous = first;
        while (pos != index) {
            pos++;
            previous = current;
            current = current.next;
        }
        if (current == first) {
            first = first.next;
        } else {
            pos = 0;
            previous.next = current.next;
        }
        return current;
    }

    // 根据节点的data删除节点(仅仅删除第一个)
    public LinkNode deleteByData(Object data) {
        LinkNode current = first;
        LinkNode previous = first; //记住上一个节点
        while (current.data != data) {
            if (current.next == null) {
                return null;
            }
            previous = current;
            current = current.next;
        }
        if (current == first) {
            first = first.next;
        } else {
            previous.next = current.next;
        }
        return current;
    }

    // 显示出所有的节点信息
    public void displayAllLinkNodes() {
        LinkNode current = first;
        while (current != null) {
            System.out.println(current.data + "+");
            current = current.next;
        }
        System.out.println();
    }

    // 根据位置查找节点信息
    public LinkNode findByPos(int index) {
        LinkNode current = first;
        if (pos != index) {
            current = current.next;
            pos++;
        }
        return current;
    }

    // 根据数据查找节点信息
    public LinkNode findByData(Object data) {
        LinkNode current = first;
        while (current.data != data) {
            if (current.next == null)
                return null;
            current = current.next;
        }
        return current;
    }
}