数据结构

《数据结构》严蔚敏

头文件SQlist.h

#ifndef SQlist_H_INCLUDED
#define SQlist_H_INCLUDED
#include<stdio.h>
#define OK 1
#define ERROR -1
#define TRUE 1
#define FALSE 0

#define MAXSIZE 100 /* 存储空间初始分配量 */
#define ListCreaty 10 /* 分配增量 */
typedef int ElemType;   /* ElemType类型根据实际情况而定，这里假设为int */
typedef int Status;     /* Status是函数的类型,其值是函数结果状态代码，如OK等 */

typedef struct
{
    ElemType *data; /* 数组，存储数据元素 */
    int length;   /* 线性表当前长度 */
    int size;    /*线性表容量*/
}SqList;
Status InitList(SqList&);
Status DestoryList(SqList&);
Status ListLength(SqList);
Status ListEmpty(SqList);
Status GetElem(SqList,int, ElemType&);
Status InsertSqList(SqList&, int, ElemType);
Status FoundElem(SqList, ElemType);
Status DeleteList(SqList&, int, ElemType&);
void ClearList(SqList&);
#endif

函数实现

#include"SQlist.h"
#include<malloc.h>
#include<iostream>
using namespace std;
/* 初始化顺序线性表 */
Status InitList(SqList&L)
{
    L.data = (ElemType*)malloc(sizeof(ElemType)*MAXSIZE);
    if (!L.data)
    {
        return ERROR;
    }
    L.size = MAXSIZE;
    L.length = 0;
    return OK;
}
/*销毁元素*/
Status DestoryList(SqList&L)
{
    if (L.length)
    {
        free(L.data);
    }
    L.data = NULL;
    L.length = 0;
    return OK;
}
/*清空线性表*/
void ClearList(SqList&L)
{
    L.length = 0;
}
/*判断为空*/
Status ListEmpty(SqList L)
{
    if (L.length)
    {
        return 0;
    }
    return 1;
}
/*插入第i个位置的元素*/
Status InsertSqList(SqList&L, int i, ElemType e)
{

    if (i<1 || i>L.length + 1)
    {
        cout << "NO" << endl;
        //return ERROR;
    }
    if (L.length > L.size)
    {
        ElemType *newbase = (ElemType*)realloc(L.data, sizeof(ElemType) * (L.size+MAXSIZE));
        if (!newbase)
        {
            return ERROR;
        }
        L.data = newbase;
        L.size += MAXSIZE;
    }
    if (L.length != 0)
    {
        ElemType *q, *p;
        q = &L.data[i - 1];
        p = &L.data[L.length - 1];
        for (; p >= q; p--)
        {
            *(p + 1) = *p;
        }
        *q = e;
        L.length++;
    }
    else
    {
        L.data[L.length] = e;
        L.length++;
    }
    return OK;
}
Status GetElem(SqList L, int i, ElemType& e)
{
    if (i<0 && i>L.length)
        return 0;
    else
    {
        e = L.data[i - 1];
    }
    return 1;
}
Status ListLength(SqList L)
{
    return L.length;
}
Status FoundElem(SqList L, ElemType e)
{
    int i;
    for (i = 0; i < L.length; i++)
    {
        if (L.data[i] == e)
        {
            return i+1;
        }
    }
    return 0;
}
Status DeleteList(SqList&L, int i, ElemType& e)
{
    if (i<1||i>L.length)
    {
        return ERROR;
    }
    ElemType *p = &L.data[i - 1];
    ElemType *q = L.data + L.length - 1;
    e = *p;
    for (; p <= q; p++)
    {
        *(p - 1) = *p;
    }
    L.length--;
    return OK;
}