顺序表的测试

定义一个结构体

# include<iostream>
# include<cstdio>
# include<stdlib.h>
using namespace std;
typedef struct
{
    int *elem;
    int length;
    int maxsize;
} ListNode;

View Code

初始化ListNode

int InitList(ListNode &L)
{
    L.elem=(int *)malloc(100*sizeof(int));
    if(!L.elem)
        exit(-1);
    L.length=0;
    L.maxsize=100;
    return 1;
}

View Code

输出ListNode的值

void Output_L(ListNode &L)
{
    for(int i=0; i<L.length; i++)
        cout<<L.elem[i]<<" ";
}

View Code

main函数测试

int main()
{
    ListNode L1;
    InitList(L1);  //测试InitList函数
    L1.length=10;
    for(int j=0; j<L1.length; j++)
    {
        L1.elem[j]=j;
    }
    Output_L(L1);
}

View Code

 

 

转载于:https://www.cnblogs.com/sxmcACM/p/3350158.html