#include <stdio.h>
#define MAXSIZE100// 定义顺序表最大长度
typedef struct {
int data[MAXSIZE];// 顺序表数组
int length;// 当前顺序表长度} SqList;voiddeleteDuplicates(SqList *L){if(L->length ==0){return;}
int k =1;// 用于记录不重复元素的位置for(int i =1; i <L->length; i++){if(L->data[i]!=L->data[i -1]){L->data[k]=L->data[i];// 将不重复的元素向前移动
k++;}}L->length = k;// 更新顺序表长度}
int main(){
SqList list ={{1,2,2,3,3,3,4,5,5,6},10};// 初始化有序顺序表printf("删除前的顺序表:");for(int i =0; i < list.length; i++){printf("%d ", list.data[i]);}printf("\n");deleteDuplicates(&list);printf("删除后的顺序表:");for(int i =0; i < list.length; i++){printf("%d ", list.data[i]);}printf("\n");return0;}