Java数据结构习题编写一个方法find()，接受一个字符串key作为参数。如果链表中的某个结点的元素数据为key，则方法返回ture，否则返回first

核心代码：

//编写一个方法find()，接受一个字符串key作为参数。如果链表中的某个结点的元素数据为key，则方法返回ture，否则返回first

public class Node {



    //链表指针
    private NODE first = null;
    public NODE getFirst() {
        return first;
    }

    private NODE lase = null;
    public NODE getLase() {
        return lase;
    }

    //计数器
    private int N = 0;
    public int getN() {
        return N;
    }

    //结点
    private class NODE{
        Object obj;
        NODE next;
    }

    //判断链表是否为空
    public Boolean IsEmpty(){
        return first == null;
    }

    //添加节点
    public void EnNode(Object obj){
        NODE oldNode = lase;
        lase = new NODE();
        lase.obj = obj;
        lase.next = null;

        if(IsEmpty()){
            first = lase;
            oldNode = lase;
        }

        oldNode.next = lase;
        N++;
    }

    //删除节点
    public Object delete(int k){
        if(k < 0 || k > N){
            System.out.println("k的范围不符合规定");
            return "";
        }

        NODE Node = first;
        Object obj = null;

        for (int i = 1; i < k - 1; i++){
            Node = Node.next;
        }

        obj = Node.next.obj;
        Node.next = Node.next.next;

        N--;

        return "删除的元素是：" + obj;
    }

    //查找
    public boolean find(Object KEY){
        NODE node = first;

        if(N <= 0){
            return false;
        }

        for(int i = 0; i < N; i++){
            if(node.obj.equals(KEY)){
                return true;
            }

            node = node.next;
        }

        return false;
    }

    //遍历
    public void print(){
        if(N <= 0){
            System.out.println("链表已为空，无法删除");
            return;
        }

        NODE node = first;

        for(int i = 0; i < N; i++){
            System.out.println("元素：" + node.obj);
            node = node.next;
        }

        System.out.println();
    }
}

测试代码：

public class Text {
    public static void main(String[] args){
        Node node = new Node();

        node.EnNode(1);
        node.EnNode(2);
        node.EnNode("add2");
        node.EnNode("add3");
        node.EnNode("add4");

        System.out.println();

        node.print();

        System.out.println();

        System.out.println(node.find(2) ? "有该值" : "无该值");
        System.out.println(node.find(3) ? "有该值" : "无该值");
        System.out.println(node.find("add3") ? "有该值" : "无该值");
        System.out.println(node.find("add5") ? "有该值" : "无该值");
    }
}

结果：

"C:\Program Files\Java\jdk1.8.0_333\bin\java.exe" "-javaagent:D:\IDEA\IntelliJ IDEA Community Edition 2020.3\lib\idea_rt.jar=57755:D:\IDEA\IntelliJ IDEA Community Edition 2020.3\bin" -Dfile.encoding=UTF-8 -classpath "C:\Program Files\Java\jdk1.8.0_333\jre\lib\charsets.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\deploy.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\access-bridge-64.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\cldrdata.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\dnsns.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\jaccess.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\jfxrt.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\localedata.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\nashorn.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\sunec.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\sunjce_provider.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\sunmscapi.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\sunpkcs11.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\ext\zipfs.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\javaws.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\jce.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\jfr.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\jfxswt.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\jsse.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\management-agent.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\plugin.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\resources.jar;C:\Program Files\Java\jdk1.8.0_333\jre\lib\rt.jar;E:\······后端······\1.2 ····java系列····\01_代码库\！Java数据结构\练习题\链表习题\查找元素\out\production\untitled" Text

元素：1
元素：2
元素：add2
元素：add3
元素：add4


有该值
无该值
有该值
无该值

进程已结束，退出代码为 0

重点代码：

  //查找
    public boolean find(Object KEY){
        NODE node = first;

        if(N <= 0){
            return false;
        }

        for(int i = 0; i < N; i++){
            if(node.obj.equals(KEY)){
                return true;
            }

            node = node.next;
        }

        return false;
    }

感谢观看~