数据结构代码演示

#include<stdio.h>
#include<malloc.h>

#define LIST_MAX_LENGTH 10

typedef struct SequentialList{
    int actualLength;
    int data[LIST_MAX_LENGTH];
} *SequentialListPtr;

void outputList(SequentialListPtr paraList)
{
	int i; 
    for( i=0; i<paraList->actualLength; i++)
    {
        printf("%d",paraList->data[i]);
    }
    printf("\r\n");
}

void outputMemory(SequentialListPtr paraListPtr)
{
    printf("The structure address is %ld\r\n",paraListPtr);
    printf("The actualLength address is %ld\r\n",&paraListPtr->actualLength);
    printf("The data address is %ld\r\n",&paraListPtr->data);
    printf("The actual data address is %ld\r\n",&paraListPtr->data[0]);
    printf("The second data addresss is %ld\r\n",&paraListPtr->data[1]);
}//output the memory

SequentialListPtr SequentialListInit(int paraData[],int paraLength)
{
    SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
    int i;
    for ( i=0;i<paraLength;i++)
    {
        resultPtr->data[i]=paraData[i];
    }
    resultPtr->actualLength=paraLength;

    return resultPtr;
}

void sequentialListInsert(SequentialListPtr paraListPtr,int paraPosition,int paraValue)
{
    if (paraListPtr->actualLength >= LIST_MAX_LENGTH)
    {
        printf("Insert Error: list full\r\n");
        return;
    }

    if(paraPosition < 0)
    {
        printf("Insert Error:position over\r\n");
        return;
    }

	int i;
    for( i=paraListPtr->actualLength;i>paraPosition;i--)
    {
        paraListPtr->data[i]=paraListPtr->data[i-1];
    }

    paraListPtr->data[paraPosition]=paraValue;

    paraListPtr->actualLength ++;
}

void sequentialInsertTest()
{
    int i;
    int tempArray[5]={3,5,2,7,4};

    printf("--- sequentialInsertTest begins. ---\r\n");

    SequentialListPtr tempList=SequentialListInit(tempArray,5);
    printf("After initialization,the list is: ");
    outputList(tempList);

    printf("The first insert list is: ");
    sequentialListInsert(tempList,0,8);
    outputList(tempList);

    printf("The last insert list is: ");
    sequentialListInsert(tempList,6,9);
    outputList(tempList);

    printf("Insert beyond the tail\r\n");
    sequentialListInsert(tempList,8,9);
    printf("The list come out: ");
    outputList(tempList);

    for(i=0;i<5;i++)
    {
        printf("Inserting %d\r\n",(i+10));
        sequentialListInsert(tempList,0,(i+10));
        outputList(tempList);
    }

    printf("--- sequentialInsertTest ends ---\r\n");
}

int sequentialListDelete(SequentialListPtr paraListPtr,int paraPostion)
{
    if(paraPostion<0)
    {
        printf("Invalid position: %d\r\n",paraPostion);
        return -1;
    }

    if(paraPostion >= paraListPtr->actualLength)
    {
        printf("Delete Error: The position %d is beyond the listlength %d\r\n",paraPostion,paraListPtr);
        return -1;
    }

    int resultValue = paraListPtr->data[paraPostion];
    int i;
    for ( i=paraPostion;i<paraListPtr->actualLength;i++)
    {
        paraListPtr->data[i] = paraListPtr->data[i+1];
    }

    paraListPtr->actualLength--;

    return resultValue;
}

/*
test delete
*/

void sequentialDeleteTest()
{
    int tempArray[5]={1,4,5,9,8};

    printf("--- sequentialDeleteTest begins ---\r\n");

    SequentialListPtr tempList = SequentialListInit(tempArray,5);
    printf("After initialization,the list is: ");
    outputList(tempList);

    printf("Delete the first,list is: ");
    sequentialListDelete(tempList,0);
    outputList(tempList);

    printf("Delete the last,list is: ");
    sequentialListDelete(tempList,3);
    outputList(tempList);

    printf("Delete the second,list is: ");
    sequentialListDelete(tempList,1);
    outputList(tempList);

    printf("Delete the 5th,list is: ");
    sequentialListDelete(tempList,5);
    outputList(tempList);

    printf("Delete the (-6)th,list is: ");
    sequentialListDelete(tempList,-6);
    outputList(tempList);

    printf("--- sequentListDeleteTest ends ---\r\n");

    outputMemory(tempList);
}

int locateElement(SequentialListPtr paraListPtr,int paraValue)
{
	int i=0;
    for( i=0;1< paraListPtr->actualLength;i++)
    {
        if (paraListPtr->data[i]==paraValue)
        {
            return i;
        }
    }

    return -1;
}

int getElement(SequentialListPtr paraListPtr,int paraPosition)
{
    if(paraPosition<0)
    {
        printf("Invaild position: %d\r\n",paraPosition);
        return -1;
    }

    if(paraPosition>=paraListPtr->actualLength)
    {
        printf("Element Get Error: the position %d is beyond the length %d\r\n",paraPosition,paraListPtr->actualLength);
        return -1;
    }

    return paraListPtr->data[paraPosition];
}

void main()
{
    sequentialInsertTest();
    sequentialListDeleteTest();
}