java实现单链表

最新推荐文章于 2025-04-23 22:15:00 发布

zeekling

最新推荐文章于 2025-04-23 22:15:00 发布

阅读量537

点赞数 1

分类专栏：算法 Java

Java 同时被 2 个专栏收录

16 篇文章

订阅专栏

算法

8 篇文章

订阅专栏

本文介绍了一种单链表的数据结构实现方式，并提供了完整的Java代码示例。通过创建Node类来表示链表节点，以及SingleLinkedList类来实现链表的基本操作，如插入、删除和查找等。

单链表的概念参照这个完全可以理解http://baike.baidu.com/link?url=-1uzZ37pcZwpN-1Zy2lCassJ2YqPQzjIPbQHdPXCwo0pGR5-sXiEY8kXNUjt2DubG_8JTSQBJrhTF182Kwo5Wq

下面是我的程序：

新建一个名为Ｎｏｄｅ的类，ｄａｔａ是数据域，而ｎｅｘｔ是指针域

package singleLinkedList;

/**
 * Created by lzh on 2/29/16.
 */
public class Node {
    public Node next;
    public Object data;

//    public Node(){}
    public Node(Object data){
        this.data = data;
    }
}

在写一个类

package singleLinkedList;

/**
 * Created by lzh on 2/29/16.
 */
public class SingleLinkedList extends RuntimeException{
    private Node first;
    private int length;
    public SingleLinkedList(){
        init();
    }
    /**
     * initialize SingleLinkedList
     */
    private void init(){
        this.first = null;
    }

    /**
     *
     * @param data insert data
     * @param locate insert location
     */
    public void insert(Object data,int locate){
        if(locate < 0){
            throw new RuntimeException("please input valid locate");
        }else if(locate == 0){
            insert(data);
        }else {
            add(data,locate);
        }
    }

    private void add(Object data,int locate){
        Node newNode = new Node(data);
        Node curr = first;
        int currLocate = 1;
        while(curr.next != null){
            if(currLocate == locate){
                newNode.next = curr.next;
                curr.next = newNode;
                length++;
                currLocate++;
            }else{
                curr = curr.next;
                currLocate++;
            }
        }
        if(currLocate == locate){
            curr.next = newNode;
            length++;
            currLocate++;
        }else if(currLocate< locate){
            throw new RuntimeException("locate is out if size");
        }
    }

    /**
     *
     * @param data insert data,default insert into first location of the SingleLinkList
     */
    public void insert(Object data){
        Node insert = new Node(data);
        insert.next = first;
        first = insert;
        length++;
    }

    /**
     *
     * @param data remove data of the SingleLinkedList
     * @return remove data
     */
    public Object remove(Object data){
        Node curr = first;
        boolean flag = false;
        if((curr.data).equals(data)){
            first = curr.next;
            length--;
            flag = true;
        }
        while(curr.next != null){
            if((curr.next.data).equals(data)){
                if(curr.next.next != null){
                    curr.next = curr.next.next;
                    length--;
                }else{
                    curr.next = null;
                }

                flag = true;
            }
            curr = curr.next;
        }
        return flag;
    }

    /**
     *
     * @param data find data in the SingleLinkedList
     * @return
     */
    public boolean find(Object data){
        Node curr = first;
        while(curr != null){
            if((curr.data).equals(data)){
                return true;
            }else{
                curr = curr.next;
            }
        }
        return false;
    }

    /**
     *
     * @return the length of the SingleLinkedList
     */
    public int size(){
        return length;
    }

    public void listAll(){
        Node curr = first;
        if(curr == null){
            System.out.println("this SingleLinkedList is empty");
        }else{
            while(curr != null){
                System.out.println(curr.data);
                curr = curr.next;
            }
        }
    }

    public boolean isEmpty(){
        if(first == null){
            return true;
        }else {
            return false;
        }
    }

}