zoukankan      html  css  js  c++  java
  • 20165314课下作业补做

    代码

    import java.util.*;
    class Stu implements Comparable{
        int id;
        String name;
        Stu(String n, int i){
            name=n;
            id=i;
        }
        public int compareTo(Object b){
            Stu st=(Stu)b;
            return (this.id-st.id);
        }
    }
    public class MyList {
        public static void main(String [] args) {
            LinkedList<Stu> list=new LinkedList<>();
            list.add(new Stu("曹歌",5312));
            list.add(new Stu("张晨晖",5313));
            list.add(new Stu("阎含",5315));
            list.add(new Stu("孙勖哲",5316));
            Iterator<Stu> iter=list.iterator();
            System.out.println("初始单链表为:");
            while (iter.hasNext()){
                Stu st=iter.next();
                System.out.println(st.id+" "+st.name);
            }
            list.add(new Stu("陈由章",5314));
            Collections.sort(list);
            iter=list.iterator();
            System.out.println("插入学号和姓名以后:");
            while (iter.hasNext()){
                Stu st=iter.next();
                System.out.println(st.id+" "+st.name);
            }
            list.remove(1);
            iter=list.iterator();
            System.out.println("删除学号和姓名以后:");
            while (iter.hasNext()){
                Stu st=iter.next();
                System.out.println(st.id+" "+st.name);
            }
    
        }
    }
    

    截图

  • 相关阅读:
    记录输出时间
    ***灵感或者没想到的思想
    Managing Difficulties
    4.20
    单调队列
    背包
    线性DP
    可持久化数据结构
    平衡树
    点分治
  • 原文地址:https://www.cnblogs.com/zhangshuai9345/p/8999977.html
Copyright © 2011-2022 走看看