数据结构实验1——顺序表

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <string>
#include <wchar.h>
#include <Windows.h>
using namespace std;

#define ok 1
#define error 0
#define overflow -2
typedef int elemtype;
const int maxn = 100;
typedef int status;
typedef struct{
    char no[20];
    char name[80];
    elemtype grade;
}student;
typedef struct{
    student *elem;
    int length;
}sqlist;

int main()
{
    SetConsoleOutputCP(65001);
    sqlist l;
    int i, choose;
    char name[80];

    status init(sqlist &l);
    status creat(sqlist &l);
    status show(sqlist l);
    status locate(sqlist l, char *name);
    status get(sqlist l, int i);
    status in(sqlist &l, int i, student e);
    status out(sqlist &l, int i);
    //status length(sqlist l);
    status destroy(sqlist &l);

    cout<<"-------------"<<endl;

    cout<<"1.初始化链表"<<endl;
    cout<<"2.构建链表"<<endl;
    cout<<"3.显示链表长度"<<endl;
    cout<<"4.显示链表内容"<<endl;
    cout<<"5.查找学生信息"<<endl;
    cout<<"6.获取学生信息"<<endl;
    cout<<"7.插入学生信息"<<endl;
    cout<<"8.删除学生信息"<<endl;
    cout<<"9.销毁链表"<<endl;
    cout<<"0.退出"<<endl;
    cout<<"-------------"<<endl;
    choose = -1;

    while(choose != 0){
        cout<<"请选择：";
        cin>>choose;
        switch(choose){
            case 1://创建链表
                {
                if(init(l)) cout<<"成功建立链表

";
                else cout<<"链表建立失败

";
                break;
            }
            case 2://构建链表
                {
                if(creat(l)) cout<<"链表构建成功

";
                else cout<<"链表构建失败

";
                break;
            }
            case 3://链表长度
                {
                cout<<"链表长度为"<<l.length<<endl<<endl;
                break;
            }
            case 4://显示链表内容
                {
                int a = show(l);
                if(!a) cout<<"无内容"<<endl<<endl;
                else cout<<"打印完成"<<endl<<endl;
                break;
            }
            case 5://查找学生信息
                {
                printf("请输入需要获取信息的学生名字:
");
                gets(name);
                int a = locate(l, name);
                if(!a) cout<<"不存在"<<endl<<endl;
                else cout<<a<<endl<<endl<<endl;
                break;
            }
            case 6://获取学生信息
                {
                printf("请输入需要获取信息的学生编号:
");
                cin>>i;
                if(!get(l, i)) cout<<"编号不合法"<<endl<<endl;
                else cout<<get(l, i)<<endl<<endl;
                break;
            }
            case 7://插入学生信息
                {
                printf("请输入要插入学生的编号:
");
                cin>>i;
                student e;
                printf("请输入要插入学生的姓名:
");
                cin>>e.name;
                printf("请输入要插入学生的学号:
");
                cin>>e.no;
                printf("请输入要插入学生的成绩:
");
                cin>>e.grade;
                if(in(l, i, e)) cout<<"插入成功"<<endl<<endl;
                else cout<<"插入失败"<<endl<<endl;
                break;
            }
            case 8://删除学生信息
                {
                printf("请输入要删除学生的编号:
");
                cin>>i;
                if(out(l, i)) cout<<"删除成功"<<endl<<endl;
                else cout<<"删除失败"<<endl<<endl;
                break;
            }
            case 9://销毁链表
                {
                if(destroy(l)) cout<<"成功删除链表

"<<endl<<endl;
                else  cout<<"链表删除失败

"<<endl<<endl;
                break;
            }
        }
    }
}

status creat(sqlist &l){//构建链表
    if(!l.elem) exit(overflow);
    if(l.length == 0) return error;
    do{
        //char no[20], name[80];
        //int grade;
        printf("输入学号，姓名，成绩：
输入0 0 0时结束
");
        scanf("%s%s%d", l.elem[l.length].no, l.elem[l.length].name, &l.elem[l.length].grade);
        l.length ++ ;
    }while(strcmp(l.elem[l.length-1].no, "0") != 0);
    l.length -- ;
    return ok;
}

status destroy(sqlist &l){//销毁
    if(l.elem) delete(l.elem);
    l.length = 0;
    return ok;
}

status init(sqlist &l){//初始化
    l.elem = new student[100];
    if(!l.elem) exit(overflow);
    l.length = 0;
    return ok;
}

status show(sqlist l){//显示内容
    if(l.length == 0) return error;
    else {
        for(int i = 0 ; i < l.length; i ++ ){
            printf("姓名：%s 学号：%s 成绩：%d

", l.elem[i].name, l.elem[i].no, l.elem[i].grade);
        }
        return ok;
    }
}

status get(sqlist l, int i){//获取学生信息
    if(i < 0 || i > l.length) return error;
    else{
        printf("姓名：%s 学号：%s 成绩：%d", l.elem[i].name, l.elem[i].no, l.elem[i].grade);
        return ok;
    }
}

status locate(sqlist l, char *n){//查找学生信息
    for(int i = 0; i < l.length; i ++ ){
        if(strcmp(l.elem[i].name, n) == 0) {
            printf("姓名：%s 学号：%s 成绩：%d", l.elem[i].name, l.elem[i].no, l.elem[i].grade);
            return i + 1;
        }
    }
    return error;
}

status in(sqlist &l, int i, student e){//插入
    if(i < 1 || i > (l.length + 1)) return error;
    else if(l.length == maxn) return error;
    for(int j = l.length - 1; j >= i - 1; j ++ ){
        l.elem[j + 1] = l.elem[j];
    }
    l.elem[i - 1] = e;
    ++ l.length;
    return ok;
}

status out(sqlist &l, int i){//删除
    if(i < 1 || i > (l.length + 1)) return error;
    for(int j = i; j <= l.length - 1; j ++ )
        l.elem[j - 1] = l.elem[j];
    -- l.length;
    return ok;
}

注意中文乱码（

 订正：初始化函数中应该为new student[maxn];

Window.h 应为windows.h

wchar.h 应为 cwchar