数据结构课设

建一个单链表,填入一些基本信息,后续对它进行增删查找等操作

package List;

public class MyTest {
    public static void main(String[] args) {

        //定义节点
        Group group1  = new Group(2021009290, "基于用户需求的共享单车预测", "常州工学院","大数据实践","曾友","徐则中");
        Group group2 = new Group(2021007148, "北京二手房交易数据分析平台", "","大数据实践","","");
        Group group3 = new Group(3, "", "","大数据实践","","");
        Group group4 = new Group(4, "", "","大数据实践","","");

        //2、初始化链表
        LinkList linkList = new LinkList();
        linkList.addGroup(group1);
        linkList.addGroup(group2);
        linkList.addGroup(group3);
        linkList.addGroup(group4);

        //遍历
        linkList.queryLinkList();

    }

}

class LinkList {
    //定义链表的开始位置
    private Group head = new Group(0, "", "","","","");

    //增加节点,从尾部
    public void addGroup(Group group) {
        Group temp = head;//辅助数组
        boolean flag = false;

        while (true) {
            if (temp.next == null) {
                flag = true;
                break;
            } else {
                temp = temp.next;
            }

        }
        if (flag) {
            temp.next = group;
        }
    }

    //遍历
    public void queryLinkList() {
        Group temp = head;
        if (head.next == null) {
            System.out.println("链表为空");
            return;
        }

        while (true) {
            if (temp.next == null) {
                return;
            }
            System.out.println(temp.next);
            temp = temp.next;
        }
    }


}

//定义一个学生信息的节点类
class Group {
    int id;//参赛队编号
    String name;//参赛作品名称
    String school;//参赛学校
    String kind;//参赛类别
    String student;//参赛学生
    String teacher;
    Group next;//下一个学生的节点

    public Group(int id, String name, String school,String kind
            ,String student,String teacher
    ) {
        this.id = id;
        this.name = name;
        this.school = school;
        this.kind=kind;
        this.student=student;
        this.teacher=teacher;
    }

    @Override
    public String toString() {
        return "Group{" +
                "id=" + id +
                ", name='" + name + '\'' +
                ", school='" + school + '\'' +"kind="+kind+'\''+"student="+student+'\''+"teacher="+teacher+
                '}';
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值