数据结构:顺序表和链表的简单操作

用数组正序初始化链表

初始定义

#include <cstdlib>
#include <iostream>
using namespace std;
typedef int ElemType;
typedef int Status;
#define MAXSIZE 100
#define OK 0
#define OVERFLOW 1
typedef struct LNode{
    ElemType data;
    struct LNode *next;
} LNode, *LinkList;

以数组a初始化链表L

Status InitList(LinkList *L, int a[], int n)
{
    LNode *Last;
    (*L) = new LNode;
    (*L) -> next = NULL;
    Last = (*L);
    for(int i = 0; i < n; i++)
    {
        LNode *p = new LNode;
        p -> data = a[i];
        p -> next = NULL;
        Last -> next = p;
        Last = p;
    }
    return OK;
}

打印链表

void Print(LinkList L)
{
    LinkList p = L;
    while(p -> next)
    {
        cout << p -> next -> data << ' ';
        p = p-> next;
    }
    cout << endl;
}

用数组a初始化链表L,输出结果查看

int a[] = {1, 4, 5, 6, 2, 45, 344, 1, 3, 78, 3};
int len = sizeof(a) / sizeof(int);
LinkList L;
if(InitList(&L, a, len))
{
    exit(OVERFLOW);
}
Print(L);

//system("pause");
//return 0;

1 4 5 6 2 45 344 1 3 78 3