数据结构-顺序表

#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)//输出结果 
{
    for(int i=0;i<paraList->actualLength ;i++)
    {
        printf("%d ",paraList->data [i]);//按顺序依次输出数据 
    }
    printf("\r\n");
}

void outputMemory(SequentialListPtr paraListPtr)
{
    printf("The address of the structure: %ld\r\n",paraListPtr);
    printf("The address of actualLength: %ld\r\n",&paraListPtr->actualLength );
    printf("The address of data: %ld\r\n",&paraListPtr->data);
    printf("The address of actual data: %ld\r\n",&paraListPtr->data[0]);
    printf("The address of second data: %ld\r\n",&paraListPtr->data[1]);
}//输出地址 

SequentialListPtr sequentialListInit(int paraData[],int paraLength)
{
    SequentialListPtr resultPtr=(SequentialListPtr)malloc(sizeof(struct SequentialList));
    //分配一处大小等于结构体 SequentialList的内存空间，地址强转为 SequentialListPtr类型 赋值给变量 resultPtr
    for(int 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("Cannot insert element: list full.\r\n");
        return;
        //顺序表元素个数大于等于最大个数，无法再插入元素 
    }
    
    if(paraPosition<0)
    {
        printf("Cannot insert element: negative position unsupported.");
        return;
        //插入位置小于0，不存在该位置 
    }
    
    if(paraPosition>paraListPtr->actualLength)
    {
        printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n",paraPosition,paraListPtr->actualLength );
        return;
    }
    
    for(int i=paraListPtr->actualLength;i>paraPosition;i--)
    {
        paraListPtr->data[i]=paraListPtr->data[i-1];
        //顺序表中paraPosition后的所有元素后移一位 
    }
    
    paraListPtr->data[paraPosition]=paraValue;
    //插入元素 
    
    paraListPtr->actualLength ++;
    //插入元素后顺序表长度加1 
}

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("Now insert to the first,the list is: ");
    sequentialListInsert(tempList,0,8);
    outputList(tempList);
    
    printf("Now insert to the last,the list is: ");
    sequentialListInsert(tempList,6,9);
    outputList(tempList);
    
    printf("Now insert beyond the tail. \r\n");
    sequentialListInsert(tempList,8,9);
    printf("The list is:");
    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 paraPosition)
{
    if(paraPosition<0)
    {
        printf("Invalid position: %d.\r\n",paraPosition);
        return -1;
    }
    
    if(paraPosition>=paraListPtr->actualLength)
    {
        printf("Cannot delete element: the position %d is beyond the list length %d",paraPosition,paraListPtr->actualLength);
        return -1;
    }
    
    int resultValue=paraListPtr->data[paraPosition];
    for(int i=paraPosition;i<paraListPtr->actualLength;i++)
    {
        paraListPtr->data[i]=paraListPtr->data[i+1];
        //顺序表中 paraPosition后的所有元素前移一位 
    }
    
    paraListPtr->actualLength--;
    //删除一个元素后顺序表长度减一 
    
    return resultValue;
}

void sequentialDeleteTest()
{
    int tempArray[5]={3,5,2,7,4};
    
    printf("---- sequentialDeleteTest begins. ----\r\n");
    
    SequentialListPtr tempList=sequentialListInit(tempArray,5);
    
    printf("After initialization,the list is: ");
    outputList(tempList);
    
    printf("Now delete to the first,the list is: ");
    sequentialListDelete(tempList,0);
    outputList(tempList);
    
    printf("Now delete to the last,the list is: ");
    sequentialListDelete(tempList,3);
    outputList(tempList);
    
    printf("Now delete the second,the list is: ");
    sequentialListDelete(tempList,1);
    outputList(tempList);
    
    printf("Now delete the 5th,the list is: ");
    sequentialListDelete(tempList,5);
    outputList(tempList);
    
    printf("Now delete the (-6)th,the list is: ");
    sequentialListDelete(tempList,-6);
    outputList(tempList);
    

    printf("---- sequentialDeleteTest ends. ----\r\n");
    
    outputMemory(tempList);
}

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

int getElement(SequentialListPtr paraListPtr,int paraPosition)
{
    if(paraPosition<0)
    {
        printf("Invalid position: %d.\r\n",paraPosition);
        return -1;
    }
    
    if(paraPosition>=paraListPtr->actualLength )
    {
        printf("Cannot get element: the position %d is beyond the listlength %d.\r\n",paraPosition,paraListPtr->actualLength );
        return -1;
    }
    
    return paraListPtr->data[paraPosition];
    //返回 paraPosition处的元素 
}

void clearList(SequentialListPtr paraListPtr)
{
    paraListPtr->actualLength =0;
}

int main()
{
    sequentialInsertTest();
    sequentialDeleteTest();
    
    return 0;
}