利用C語言實現動態順序表

                                 利用C語言實現動態順序表

1. 數據類型及動態分配順序存儲結構

#define INIT_SIZE 10                           //當前默認有效值
#define DEFAULT_INC 10                    //動態分配默認增加個數

typedef int DataType;

typedef struct SeqList
{
     DataType* data;                            //指向空間的指針
     int size;                                          //當前有效的個數
     int capacity;                                   //容量
}SeqList,*pSeqList;

2. 動態順序表的經常使用操做

(1) 順序表的初始化

void InitSeqList(pSeqList pSeq)//初始化順序表
{
     assert(pSeq);
     pSeq->data = (DataType *)malloc(INIT_SIZE*sizeof(DataType));//
     memset(pSeq->data,0,INIT_SIZE*sizeof(DataType));
     pSeq->capacity = INIT_SIZE;
     pSeq->size = 0;
}

(2) 在順序表中尾插，頭插，在特定位置插入時，須要判斷當前順序表的容量是否夠用，若不夠，則須要開闢新的空間

void CheckCapacity(pSeqList pSeq)//判斷容量
{
     if(pSeq->size == pSeq->capacity)
     {
          pSeq->data = (DataType*)realloc(pSeq->data,pSeq->capacity + DEFAULT_INC);
          pSeq->capacity = pSeq->capacity + DEFAULT_INC;
     }
}

(3) 動態順序表的經常使用操做

//------------------------------- 尾插 -------------------------------------

void PushBack(pSeqList pSeq, DataType x)             
{
     assert(pSeq);
     CheckCapacity(pSeq);
     pSeq->data[pSeq->size] = x;
     pSeq->size++;
}

//-------------------------------- 尾刪 ------------------------------------

void PopBack(pSeqList pSeq)                                    
{
     assert(pSeq);
     if(pSeq->size == 0)
     {
          printf("順序表爲空");
     }
     pSeq->size--;
}

//----- 頭插，從尾部向前，每次後移一位，空出第一位插入，size++ -----

void PushFront(pSeqList pSeq, DataType x)                
{ 
     int i = 0;
     assert(pSeq);
     CheckCapacity(pSeq);
     for(i=pSeq->size-1; i>=0;i--)
     {
          pSeq->data[i+1] = pSeq->data[i];
     }
     pSeq->data[0] = x;
     pSeq->size++;
}

//------------- 頭刪，從前超後，每一次前移一位，size--  ----------------

void PopFront(pSeqList pSeq)                                     
{
     int i = 0;
     assert(pSeq);
     if(pSeq->size == 0)
     {
          printf("順序表爲空!");
     }
     for(i = 0;i<pSeq->size-1;i++)
     {
          pSeq->data[i] = pSeq->data[i+1];
     }
     pSeq->size--;
}

//-- 插入，從後移到指向pos的那一位，開始後移，將x賦給指向pos的結點 ---

void Insert(pSeqList pSeq, int pos, DataType x)
{
     int i = 0;
     assert(pSeq);
     assert((pos>=0)&&(pos<pSeq->size-1));
     for(i=pSeq->size-1;i>=pos;i--)
     {
          pSeq->data[i+1] = pSeq->data[i];
     }
     pSeq->data[pos] = x;
     pSeq->size++;
}

//------------------------- 刪除指定元素 ---------------------------------------

void Remove(pSeqList pSeq,DataType x)          
{
     int pos = Find(pSeq,x);
     int i = 0;
     assert(pSeq);
     for(i=pos;i<pSeq->size-1;i++)
     {
          pSeq->data[i] = pSeq->data[i+1];
     }
     pSeq->size--;
}

//-------------------------  刪除全部相同節點 ----------------------------------

void RemoveAll(pSeqList pSeq, DataType x)      
{
     int pos = Find(pSeq,x);
     assert(pSeq);
     while(pos != -1)
     {
          int i = 0;
          for(i=pos ;i<pSeq->size-1;i++)
          {
               pSeq->data[i] = pSeq->data[i+1];
          }
          pSeq->size--;
          pos = Find(pSeq ,x);
     }
}

//---------------------------------  查找  -------------------------------------

int Find(pSeqList pSeq,DataType x)            
{
     int i = 0;
     assert(pSeq);
     for(i=0;i<pSeq->size;i++)
     {
          if(pSeq->data[i] == x)
          {
               return i;
          }
     }
     return -1;
}

//---------------------------------- 逆序 --------------------------------------

void ReverseList(pSeqList pSeq)                
{
     int start = 0;
     int tail = pSeq->size-1;
     assert(pSeq);
     while(start < tail)
     {
          DataType tmp = pSeq->data[start];
          pSeq->data[start] = pSeq->data[tail];
          pSeq->data[tail] = tmp;
          start++;
          tail--;
     }
}

//----------------------------------  排序  ------------------------------------

void SortList(pSeqList pSeq)                   
{
     int i = 0;
     int j = 0;
     assert(pSeq);
     for(i = 0;i<pSeq->size-1;i++)
     {
          for(j = 0;j<pSeq->size-1-i;j++)
          {
               if(pSeq->data[j] > pSeq->data[j+1])
               {
                    DataType tmp = pSeq->data[j];
                    pSeq->data[j] = pSeq->data[j+1];
                    pSeq->data[j+1] = tmp;
               }
          }
     }
}

// --------------------------------  折半查找  ---------------------------------

int BinarySearch(pSeqList pSeq,DataType x)     {     int left = 0;     int right = pSeq->size-1;     assert(pSeq);     while(left <= right)     {          int mid = left-((left - right)>>1);          if(pSeq->data[mid] == x)          {               return mid;          }          else if(x > pSeq->data[mid])          {               left = mid+1;          }          else           {               right = mid-1;          }     }}