数据结构顺序表

来源：互联网发布：wpf 管理系统源码下载编辑：程序博客网时间：2024/05/29 08:52

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<stdlib.h>using namespace std;typedef struct sqlist lnode;#define list_size 1000struct sqlist{    int *elem;    string *str;    int listsize;} ;int Initializer_list(sqlist &L)  //建表初始化{    L.elem = (int *)malloc(sizeof(int));    if(!L.elem) return -1;    L.listsize = list_size;    return 0;}int creatnewlist(sqlist &L)  // 建立顺序表{    int i;    L.elem = (int *)malloc(sizeof(int)*list_size);    L.str =new string[list_size];    if(!L.elem) return -1;    else    {        for(i = 1; i<=10; i++)        {            cin>>L.str[i];            scanf("%d",&L.elem[i]);        }    }    return 0;}void show(sqlist &L)  //输出顺序表{    int i;    for(i = 1; i<=10; i++)    {        cout<<L.str[i]<<" "<<L.elem[i]<<endl;    }}int main(){    sqlist l;    Initializer_list(l);    creatnewlist(l);    show(l);}

//哈理工oj上的一道题。

阅读全文

0 0