python中的数据结构

链表

class student:
      def __init__(self):
        self.name=''
        self.score=0
        self.no=''
        self.next=None

#建立链表头部
head=student()
head.next=None

r=head
select=0
while(select!=2):
    print('(1)新增 (2)离开=>')
    try:
        select=int(input('请输入一个选项：'))
    except ValueError:
        print('输入错误')
        print('请重新输入\n')
    if select ==1:
        new=student()
        new.name=input('姓名：');
        new.score=eval(input('成绩：'))
        new.no=input('学号：')
        new.next=None

        r.next=new
        r=r.next

p=head.next
while(p!=None):
    print("姓名：{:10} 学号:{:10} 数学成绩:{:10d}".format(p.name,p.no,p.score))
    p=p.next

 结构体

sclass student:
      def __init__(self):
        self.name=''
        self.score=0
        self.no=''

s = [i for i in range(0,100)]

def take(a):
    return a[1];

n = eval(input())
list = []
list_ = []

for i in range(0,n):
    name = input("name:"); score = eval(input("score:")); no = input("no:")
    s[i] = student()
    s[i].name = name; s[i].score = score; s[i].no = no
    
    list_ = []
    list_.append(name);list_.append(score);list_.append(no);
    list.append(list_)

print(list)
   
list.sort(key = take)

for i in range(0,n):
    print(list[i])
for i in range(0,n):
    print("{:} {:d} {:}".format(s[i].name,s[i].score,s[i].no)