谁能帮俺挑挑错!

#include <stdio.h>

#include <malloc.h>

#define LISTSIZE 10

typedef struct

{

char *elem;

int length;

int listsize;

}SqList;

static void InitList_Sq(SqList *L);

static void ListInsert_Sq(SqList *L, int n);

static void ListMerge_Sq(SqList *L1, SqList *L2, SqList *L3);

static void DestroyList_Sq(SqList *L);

static void Print(SqList *L);

int main(void)

{

SqList L1, L2, L3;

InitList_Sq(&L1);

ListInsert_Sq(&L1, LISTSIZE);

Print(&L1);

InitList_Sq(&L2);

ListInsert_Sq(&L2, LISTSIZE);

Print(&L2);

ListMerge_Sq(&L1, &L2, &L3);

Destroy_Sq(&L1);

Destroy_Sq(&L2);

print(&L3);

return 0;

}

static void InitList_Sq(SqList *L)

{

(*L).elem = (char*)malloc(LISTSIZE * sizeof(char));

if (!(*L).elem) exit(1);

(*L).length = 0;

(*L).listsize = LISTSIZE;

}

static void ListInsert_Sq(SqList *L, int n)

{

int i;

for (i = 0; i < n; i++)

{

Printf("Enter the char:\n");

scanf("%c",&((*L).elem[i]));

}

}

static void ListMerge_Sq(SqList *L1, SqList *L2, SqList *L3)

{

int i = 0, j = 0;

(*L3).elem = (char*)molloc(2 * LISTSIZE * sizeof(char));

if (!(*L3).elem) exit(1);

while (i < (*L1).listsize)

(*L3).elem[i++] = (*L1).elem[i++];

i = i-1;

while (j < (*L2).listsize)

(*L3).elem[i++] = (*L3).elem[j++];

}

static void DestroyList_Sq(SqList *L)

{

if ((*L).elem == NULL) exit(1);

free((*L).elem);

(*L).elem = NULL;

}

static void Print(SqList *L)

{

int i=0;

while (i < (*L).listsize)

{

printf("%d ",(*L).elem[i++]);

}

printf("\n");

}

hehe 刚学！！
学习中！
能帮着把错误的算法给改改吗！？？

程序能运行，但算法有错误！！
怎么也得不了正确结果，　我感觉void ListInsert2(Sqlist *L) 有错误！！
调了好长时间还是不行，帮帮忙！

#include <stdio.h>
#include <malloc.h>
#define LISTSIZE 10

typedef struct
{
int *elem;
int length;
int listsize;
}SqList;

void InitList(SqList *L);
void DestroyList(SqList *L);
int ListEmpty(SqList *L);
int ListLength(SqList *L);
int GetElem(SqList *L, int i, int *e);
void ListInsert(SqList *L, int n);
void ListInsert2(SqList *L, int i, int e);
int ListDelete(SqList *L, int i, int *e);
void Print(SqList *L);

int main(void)
{
int k, length, e1, e2, z;

SqList L;

InitList(&L);
ListInsert(&L, LISTSIZE - 1);
Print(&L);
ListInsert2(&L, 2, 20);
Print(&L);

z = ListDelete(&L, 3, &e1);
k = GetElem(&L, 4, &e2);
Print(&L);
length = ListLength(&L);

printf("z = %d\n",z);
printf("k = %d\n",k);
printf("length = %d\n",length);
Print(&L);

ListInsert2(&L, 2, 4);
Print(&L);

length = ListLength(&L);
printf("length = %d\n",length);

return 0;
}

void InitList(SqList *L)
{
(*L).elem = (int*)malloc(LISTSIZE * sizeof(int));
if (!(*L).elem) exit(1);

(*L).length = 0;
(*L).listsize = LISTSIZE;
}

void DestroyList(SqList *L)
{
if ((*L).elem == NULL) exit(1);

free((*L).elem);

(*L).elem = NULL;
}

int ListEmpty(SqList *L)
{
if ((*L).elem == NULL) exit(1);
if ((*L).length == 0) return 0;
else return 1;
}

int ListLength(SqList *L)
{
if ((*L).elem == NULL) exit(1);
return (*L).length;
}

int GetElem(SqList *L, int i, int *e)
{
if ((*L).elem == NULL) exit(1);
if (i<1 || i>((*L).length + 1)) return -1;
e = &(*L).elem[i];
return *e;
}

void ListInsert(SqList *L, int n)
{
int i;
if ((*L).elem == NULL) exit(1);

for (i = 0; i < n; i++)
{
printf("Enter one number:\n");
scanf("%d",&(*L).elem[i]);

++(*L).length;
}
}

void ListInsert2(SqList *L, int i, int e)
{
int *p,j,*q;

if ((*L).elem == NULL) exit(1);
if (i<1 || i>((*L).length + 1)) exit(1);

p = &(*L).elem[(*L).length - 1];
for (j = (*L).length -1; j >= i-1; --j)
{
*(p + 1) = *p;
}
q = &(*L).elem[i];

*q = e;
}

int ListDelete(SqList *L, int i, int *e)
{
int *p;
int j;
if ((*L).elem == NULL) exit(1);
if (i<1 || i>((*L).length +1)) exit(1);

*e = (*L).elem[i];
p = &(*L).elem[i];

for (j = i+1; j <((*L).length - 1); ++j)
{
*(p - 1) = *p;
}
--(*L).length;
return *e;
}

void Print(SqList *L)
{
int i;

if ((*L).elem == NULL) exit(1);

for ( i = 0; i < (*L).length; i++)
{
printf("%d ",(*L).elem[i]);
}

printf("\n");
}

刚才没看到，谢谢 论坛!

麻烦论坛大哥写个正常的,学习一下!