用python实现1、编写一组程序,基于单链表,用头插法建表,实现两个寝室学生姓名数据的建表、展示、查找、定位、插入、删除、判定表空和求表长的操作。依次输入两个宿舍学生姓名:自己宿舍和隔壁宿舍同学。测试要求如下: (1)展示两个宿舍所有学生的姓名及人数; (2)查找本宿舍长在表中的位置; (3)在表中自己的位置后面加入宿舍新成员“...”,删除宿舍里的已转走的学生“...”,展示两个宿舍现有的同学。

时间: 2023-12-06 17:39:40 浏览: 15
下面是使用Python实现的单链表程序: ```python class Node: def __init__(self, data): self.data = data self.next = None class LinkedList: def __init__(self): self.head = None def insert_at_beginning(self, data): new_node = Node(data) new_node.next = self.head self.head = new_node def display(self): temp = self.head while temp: print(temp.data) temp = temp.next def search(self, data): temp = self.head pos = 1 while temp: if temp.data == data: return pos temp = temp.next pos += 1 return -1 def insert_at_position(self, data, pos): if pos == 1: self.insert_at_beginning(data) else: new_node = Node(data) temp = self.head for i in range(pos-2): temp = temp.next new_node.next = temp.next temp.next = new_node def delete(self, data): temp = self.head if temp and temp.data == data: self.head = temp.next temp = None return prev = None while temp and temp.data != data: prev = temp temp = temp.next if temp is None: return prev.next = temp.next temp = None def is_empty(self): return self.head is None def length(self): temp = self.head count = 0 while temp: count += 1 temp = temp.next return count if __name__ == '__main__': dorm1 = LinkedList() dorm2 = LinkedList() # input dorm1 students' names while True: name = input("Enter a student's name or 'done' to finish: ") if name == 'done': break dorm1.insert_at_beginning(name) # input dorm2 students' names while True: name = input("Enter a student's name or 'done' to finish: ") if name == 'done': break dorm2.insert_at_beginning(name) # display both dorms' students' names print("Dorm 1:") dorm1.display() print("Total number of students:", dorm1.length()) print("Dorm 2:") dorm2.display() print("Total number of students:", dorm2.length()) # search for a student in dorm1 name = input("Enter a student's name to search in dorm 1: ") pos = dorm1.search(name) if pos == -1: print("Student not found in dorm 1") else: print(name, "is at position", pos, "in dorm 1") # insert a new student in dorm1 name = input("Enter the name of new student in dorm 1: ") pos = int(input("Enter the position to insert the new student: ")) dorm1.insert_at_position(name, pos) print("After adding a new student, the list is:") dorm1.display() # delete a student in dorm1 name = input("Enter the name of student to delete from dorm 1: ") dorm1.delete(name) print("After deleting the student, the list is:") dorm1.display() # delete a student who has transferred from dorm1 name = input("Enter the name of student who has transferred from dorm 1: ") dorm1.delete(name) print("After deleting the transferred student, the list is:") dorm1.display() # display both dorms' students' names print("Dorm 1:") dorm1.display() print("Total number of students:", dorm1.length()) print("Dorm 2:") dorm2.display() print("Total number of students:", dorm2.length()) ``` 运行结果: ``` Enter a student's name or 'done' to finish: Alice Enter a student's name or 'done' to finish: Bob Enter a student's name or 'done' to finish: Charlie Enter a student's name or 'done' to finish: done Enter a student's name or 'done' to finish: Dave Enter a student's name or 'done' to finish: Eve Enter a student's name or 'done' to finish: Fred Enter a student's name or 'done' to finish: done Dorm 1: Charlie Bob Alice Total number of students: 3 Dorm 2: Fred Eve Dave Total number of students: 3 Enter a student's name to search in dorm 1: Alice Alice is at position 3 in dorm 1 Enter the name of new student in dorm 1: Dan Enter the position to insert the new student: 2 After adding a new student, the list is: Charlie Dan Bob Alice Enter the name of student to delete from dorm 1: Bob After deleting the student, the list is: Charlie Dan Alice Enter the name of student who has transferred from dorm 1: Alice After deleting the transferred student, the list is: Charlie Dan Dorm 1: Charlie Dan Total number of students: 2 Dorm 2: Fred Eve Dave Total number of students: 3 ```

最新推荐

recommend-type

Java与Python之间使用jython工具类实现数据交互

今天小编就为大家分享一篇关于Java与Python之间使用jython工具类实现数据交互,小编觉得内容挺不错的,现在分享给大家,具有很好的参考价值,需要的朋友一起跟随小编来看看吧
recommend-type

Python基于滑动平均思想实现缺失数据填充的方法

今天小编就为大家分享一篇关于Python基于滑动平均思想实现缺失数据填充的方法,小编觉得内容挺不错的,现在分享给大家,具有很好的参考价值,需要的朋友一起跟随小编来看看吧
recommend-type

python实现将两个文件夹合并至另一个文件夹(制作数据集)

主要介绍了python实现将两个文件夹合并至另一个文件夹(制作数据集),具有很好的参考价值,希望对大家有所帮助。一起跟随小编过来看看吧
recommend-type

python实现两个文件合并功能

主要为大家详细介绍了python实现两个文件合并功能,一个简单的文件合并程序,具有一定的参考价值,感兴趣的小伙伴们可以参考一下
recommend-type

利用Python实现Excel的文件间的数据匹配功能

主要介绍了利用Python实现Excel的文件间的数据匹配,本文通过一个函数实现此功能,通过实例代码给大家介绍的非常详细,对大家的学习或工作具有一定的参考借鉴价值,需要的朋友可以参考下
recommend-type

zigbee-cluster-library-specification

最新的zigbee-cluster-library-specification说明文档。
recommend-type

管理建模和仿真的文件

管理Boualem Benatallah引用此版本:布阿利姆·贝纳塔拉。管理建模和仿真。约瑟夫-傅立叶大学-格勒诺布尔第一大学,1996年。法语。NNT:电话:00345357HAL ID:电话:00345357https://theses.hal.science/tel-003453572008年12月9日提交HAL是一个多学科的开放存取档案馆,用于存放和传播科学研究论文,无论它们是否被公开。论文可以来自法国或国外的教学和研究机构,也可以来自公共或私人研究中心。L’archive ouverte pluridisciplinaire
recommend-type

实现实时数据湖架构:Kafka与Hive集成

![实现实时数据湖架构:Kafka与Hive集成](https://img-blog.csdnimg.cn/img_convert/10eb2e6972b3b6086286fc64c0b3ee41.jpeg) # 1. 实时数据湖架构概述** 实时数据湖是一种现代数据管理架构,它允许企业以低延迟的方式收集、存储和处理大量数据。与传统数据仓库不同,实时数据湖不依赖于预先定义的模式,而是采用灵活的架构,可以处理各种数据类型和格式。这种架构为企业提供了以下优势: - **实时洞察:**实时数据湖允许企业访问最新的数据,从而做出更明智的决策。 - **数据民主化:**实时数据湖使各种利益相关者都可
recommend-type

用 Python 画一个可以动的爱心

好的,我可以帮助您使用Python来绘制一个动态的爱心。您可以使用turtle库来实现。以下是实现代码: ```python import turtle import math # 设置画布和画笔 canvas = turtle.Screen() canvas.bgcolor("black") pencil = turtle.Turtle() pencil.speed(0) pencil.color("red", "pink") pencil.pensize(3) # 定义爱心函数 def draw_love(heart_size, x_offset=0, y_offset=0):
recommend-type

JSBSim Reference Manual

JSBSim参考手册,其中包含JSBSim简介,JSBSim配置文件xml的编写语法,编程手册以及一些应用实例等。其中有部分内容还没有写完,估计有生之年很难看到完整版了,但是内容还是很有参考价值的。