C语言学习笔记-顺序表

#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include "conio.h"
#define ERROR 0
#define OK 1
#define MAXSIZE 10
typedef int ElemType;
typedef struct{
ElemType elem [MAXSIZE];
int last;
}SeqList;/*打印顺序表*/
void ShowList(SeqList *L)
{
for(int i=; i<=L->last; i++)
{
printf("%d ",L->elem[i]);
}
printf("\n\n");
}/*删除顺序表*/
int DelList(SeqList *L,int i,ElemType *e){
int k;
if((i<)||(i>L->last+)){
printf("删除位置不合法！");
return (ERROR);
}
*e=L->elem[i-];
for(k=i;k<L->last;k++){
L->elem[k-]=L->elem[k];
}
L->last--;
return (OK);
}/*主函数*/
int _tmain(int argc, _TCHAR* argv[])
{
SeqList *myList;
int i;
int flag=;
ElemType inputValue,deleteValue;
myList= (SeqList *)malloc(sizeof(SeqList));
myList->last = -;
printf("输入");
while(flag){
scanf("%d",&inputValue);
if(inputValue!=-)
{
if(myList->last==MAXSIZE-)
printf("顺序表已满");
else
{
myList->last=myList->last+;
myList->elem[myList->last] = inputValue;
}
}
else
flag=;
}
printf("输入的数组为：\n");
ShowList(myList); //删除冗余元素
printf("删除冗余数据........................\n\n");
i=;
while(i<myList->last){
if(myList->elem[i+] != myList->elem[i]){
i++;
}else{
DelList(myList,i+,&deleteValue);
}
} printf("删除后的链表为：\n");
ShowList(myList);
getch();
}