[C]顺序表全功能实现

如遇错误，敬请指正！

编译环境 Vs2008
**

//SeqList.h //顺序表声明部分

**

#pragma once

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>

#define MAX_SIZE 100

enum{
	Bigfront = 1,
	Smallfront = 2
};
typedef int DataType;

typedef struct SeqList
{
	DataType *array;
	int capacity;
	int size;
}SeqListR;

int i,m,n;
//初始化，销毁
void SeqListInit(SeqListR *pSeq);
void SeqListDestry(SeqListR *pSeq);

// 增删改查
// 尾插，插入在顺序表的尾部
void SeqListPushBack(SeqListR *pSeq ,DataType data);
// 头插，插入在顺序表的头部 ([0])
void SeqListPushFront(SeqListR *pSeq ,DataType data);
// 尾删，删除顺序表尾部的数据
void SeqListPopBack(SeqListR *pSeq);
// 头删，删除顺序表头部的数据
void SeqListPopFront(SeqListR *pSeq);
//插入元素在某位置
void SeqListInsert(SeqListR *pSeq ,int pos,DataType data);
//删除某位置元素
void SeqListErase(SeqListR* pSeq, int pos);
//打印
void SeqListPrint(const SeqListR *pSeq);
//查找某元素位置并返回
int SeqListFind(SeqListR* pSeq, DataType f_data,int start);

//删除顺序表中所有某元素
void SeqListRemove(SeqListR* pSeq, DataType r_data);
//修改某下标未知的元素
void SeqListModify(SeqListR* pSeq, int pos, DataType m_data);

//冒泡排序
void SeqListBubbleSort(SeqListR* pSeq);

//二分查找
int SeqListBinaryFind(SeqListR* pSeq, DataType f_data);

// 本题要求：时间复杂度：O(N) 空间复杂度 O(1)
void SeqListRemoveAll(SeqListR* pSeq, DataType Rm_data);

//SeqList.c //顺序表实现部分

#include "SeqList.h"


// 内部接口声明
static void CheckCapacity(SeqListR *pSeq);

// 内部接口
void CheckCapacity(SeqListR *pSeq){
	int newcapacity;
	DataType *newArray;
	assert(pSeq);
	if (pSeq->size < pSeq->capacity)
		return;
	else{
		newcapacity = pSeq->capacity * 2;
		newArray = (DataType *)malloc(sizeof(DataType) * newcapacity);
		assert(newArray);
		for (i=0; i<pSeq->size; i++)
		{
			newArray[i] = pSeq->array[i];
		}
		free(pSeq->array);
		pSeq->array = newArray;
		pSeq->capacity = newcapacity;
	}
}

void SeqListInit(SeqListR *pSeq){
	assert(pSeq);
	pSeq->capacity = 10;
	pSeq->size = 0;
	pSeq->array = (DataType *)malloc(sizeof(DataType) * pSeq->capacity);
}

void SeqListDestry(SeqListR *pSeq){
	assert(pSeq);
	pSeq->capacity = 0;
	pSeq->size = 0;
	free(pSeq->array);
	pSeq->array = NULL;
}

// 尾插，插入在顺序表的尾部
void SeqListPushBack(SeqListR *pSeq ,DataType data){
	assert(pSeq);
	CheckCapacity(pSeq);
	pSeq->array[pSeq->size] = data;
	pSeq->size++;
}


 //头插，插入在顺序表的头部 ([0])
void SeqListPushFront(SeqListR *pSeq ,DataType data){
	assert(pSeq);
	CheckCapacity(pSeq);
	for (i=pSeq->size; i>0; i--)
	{
		pSeq->array[i] = pSeq->array[i-1];
	}
	pSeq->array[0] = data;
	pSeq->size++;
}
// 尾删，删除顺序表尾部的数据
void SeqListPopBack(SeqListR *pSeq){
	assert(pSeq);
	pSeq->size--;
}
// 头删，删除顺序表头部的数据
void SeqListPopFront(SeqListR *pSeq){
	assert(pSeq);
	for (i=1; i<pSeq->size; i++)
	{
		pSeq->array[i-1] = pSeq->array[i];
	}
	pSeq->size--;
}
//插入元素在某位置
void SeqListInsert(SeqListR *pSeq ,int pos,DataType data){
	assert(pSeq);
	if (pos<0)
	{
		printf("输入位置错误，返回且未插入!\n");
		return;
	}
	CheckCapacity(pSeq);
	for (i=pSeq->size; i>pos; i--)
	{
		pSeq->array[i] = pSeq->array[i-1];
	}
	pSeq->array[pos] = data;
	pSeq->size++;
}
//删除某位置元素
void SeqListErase(SeqListR* pSeq, int pos){
	assert(pSeq);
	if (pos<0)
	{
		printf("输入位置错误，返回且未删除!\n");
		return;
	}
	for (i=pos; i<pSeq->size-1; i++)
	{
		pSeq->array[i] = pSeq->array[i+1];
	}
	pSeq->size--;
}

//删除顺序表中所有某元素
void SeqListRemove(SeqListR* pSeq, DataType r_data){
	int count = 0;
	assert(pSeq);
	while(-2 != (i=SeqListFind(pSeq,r_data,-1))){
		SeqListErase(pSeq,i);
		count++;
	}
	printf("本次共删除了%d个元素!\n",count);
}
//查找某元素位置并返回
int SeqListFind(SeqListR* pSeq, DataType f_data,int start)
{
	int j;
	assert(pSeq);
	for (j = start+1; j<pSeq->size; ++j)
	{
		if(f_data == pSeq->array[j])
			return j;
	}
	return -2;
}

//修改某下标未知的元素
void SeqListModify(SeqListR* pSeq, int pos, DataType m_data){
	assert(pSeq);
	if (pos<0 || pos >= pSeq->size)
	{
		printf("输入下标位置错误,无操作返回!\n");
		return;
	}
	pSeq->array[pos] = m_data;
}

static void swap(DataType *p, DataType *q){
	DataType tmp;
	assert((p != q )!= NULL);
	tmp = *p;
	*p = *q;
	*q =tmp;
}
//冒泡排序
void SeqListBubbleSort(SeqListR* pSeq,int check){
	assert(pSeq);
	if (Bigfront == check)
	{
		for (m=0; m<pSeq->size-1; m++)
		{
			for (n=m+1; n<pSeq->size;n++)
			{
				if (pSeq->array[m] < pSeq->array[n])
				{
					swap(&pSeq->array[m],&pSeq->array[n]);
				}
			}
		}
	}
	else if (Smallfront == check)
	{
		for (m=0; m<pSeq->size-1; m++)
		{
			for (n=m+1; n<pSeq->size;n++)
			{
				if (pSeq->array[m] > pSeq->array[n])
				{
					swap(&pSeq->array[m],&pSeq->array[n]);
				}
			}
		}
	}
}

//二分查找(必须在有序且从小到大的排序前提下)
int SeqListBinaryFind(SeqListR* pSeq, DataType f_data){
	assert(pSeq);
	m = 0;
	n = pSeq->size;
	i = (m+n)/2;
	while(m <= n){
		if(pSeq->array[i] > f_data){
			n = i-1;
			i = (m+n)/2;
		}
		else if(pSeq->array[i] < f_data){
			m = i+1;
			i = (m+n)/2;
		}
		else{
			return i;
		}
	}
	return -1;
}

//打印
void SeqListPrint(const SeqListR *pSeq){
	assert(pSeq);
	for (i=0; i<pSeq->size; i++)
	{
		printf("%d ",pSeq->array[i]);
	}
	printf("\n顺序表一共有%d个元素!\n",pSeq->size);
}

// 本题要求：时间复杂度：O(N) 空间复杂度 O(1)
void SeqListRemoveAll(SeqListR* pSeq, DataType Rm_data){
	DataType *tmparray;
	assert(pSeq);
	//方法1
#if 0 //时间复杂度 O(n`2)
	while((m = SeqListFind(pSeq,Rm_data) != -2)){
		SeqListErase(pSeq,m);
	}
#endif
	//方法2
#if 0 //时间复杂度 O(n) 空间复杂度 O(n)
	tmparray = (DataType*)malloc(sizeof(DataType)*pSeq->size);
	assert(tmparray);
	m = 0;
	for(i=0; i<pSeq->size; i++){
		if (Rm_data != pSeq->array[i]){
			tmparray[m++] = pSeq->array[i];
		}
	}
	for(n=0; n<m; n++){
		pSeq->array[n] = tmparray[n];
	}
	free(tmparray);
	tmparray = NULL;
	pSeq->size = m;
#endif
	//方法3
	//时间复杂度：O(N) 空间复杂度 O(1)
	n=0;
	for (m=0; m<pSeq->size; m++)
	{
		if (pSeq->array[m] != Rm_data){
			pSeq->array[n++] = pSeq->array[m];
		}
	}
	pSeq->size = n;
}

//test.c //测试部分

#include "SeqList.h"

int main()
{
	int m = -1;
	SeqListR seqList;
	SeqListInit(&seqList);   //对链表初始化

	assert(seqList.size == 0);

	printf("尾插:\n");
	SeqListPushBack(&seqList,1);
	SeqListPushBack(&seqList,2);
	SeqListPushBack(&seqList,3);
	SeqListPushBack(&seqList,4);	
	SeqListPushBack(&seqList,5);
	SeqListPushBack(&seqList,6);
	SeqListPrint(&seqList);

	printf("头插:\n");
	SeqListPushFront(&seqList,0);
	SeqListPrint(&seqList);

	printf("头删:\n");
	SeqListPopFront(&seqList);
	SeqListPrint(&seqList);

	printf("尾删:\n");
	SeqListPopBack(&seqList);
	SeqListPrint(&seqList);

	printf("中间插入:\n");
	SeqListInsert(&seqList,2,5);
	SeqListPrint(&seqList);

	printf("中间删除:\n");
	SeqListErase(&seqList,4);
	SeqListPrint(&seqList);
	while( (m = SeqListFind(&seqList,5,m))!= -2)
	{
		i = 0;
		i++;
		printf("该元素在顺序表中第%d次出现在下标为%d的位置\n",i,m);
	}

	printf("删除顺序表中所有某元素:\n");
	SeqListRemove(&seqList,5);
	SeqListPrint(&seqList);

	printf("修改某下标未知的元素:\n");
	SeqListModify(&seqList,2,9);
	SeqListModify(&seqList,1,8);
	SeqListModify(&seqList,0,7);
	SeqListPrint(&seqList);
	printf("尾插:\n");
	SeqListPushBack(&seqList,1);
	SeqListPushBack(&seqList,2);
	SeqListPushBack(&seqList,3);
	SeqListPushBack(&seqList,4);	
	SeqListPushBack(&seqList,5);
	SeqListPushBack(&seqList,6);
	SeqListPrint(&seqList);

	printf("冒泡排序:\n");
	printf("请选择: 1.Bigfront 2.Smallfornt:\n");
	scanf("%d",&i);
	switch (i)
	{
	case Bigfront:
		SeqListBubbleSort(&seqList,Bigfront);
		break;
	case Smallfront:
		SeqListBubbleSort(&seqList,Smallfront);
		break;
	default:
		printf("输入错误,无操作返回!\n");
	}
	SeqListPrint(&seqList);

	printf("该元素所在的下标为%d\n",SeqListBinaryFind(&seqList,4));
	printf("尾插:\n");
	SeqListPushBack(&seqList,1);
	SeqListPushBack(&seqList,2);
	SeqListPushBack(&seqList,3);
	SeqListPushBack(&seqList,4);
	SeqListPrint(&seqList);
	printf("删除某元素所有下标的值:\n");
	SeqListRemoveAll(&seqList,4);
	SeqListPrint(&seqList);
	return 0;
}