试题

单链表1、求单链表中有效节点的个数2、查找单链表中的倒数第k个结点03、单链表的反转4、从尾到头打印单链表5、合并两个有序的单链表，合并之后的链表依然有序

单链表

数据类

class Student{int id;String name;Student next; // 指向下一个节点public Student(int id, String name) {this.id = id;this.name = name;}@Overridepublic String toString() {return "Student[ 学号 = " + id + ", 姓名 = " + name + ];}}

单链表类

class SinglyLinkedList{private Student head = new Student(0,""); //头节点public Student getHead(){return head;}//遍历public void info(){if (head.next == null){System.out.println("链表为空");return;}Student temp = head.next;while (true){if(temp == null){break;}System.out.println(temp);temp = temp.next;}}//添加public void add(Student student){Student temp = head; //辅助变量boolean isFalse = false;//添加的编号(id)是否存在while (true){if (temp.next == null){//链表最后break;}if (temp.next.id > student.id){//编号比较，位置找到break;}if (temp.next.id == student.id){