#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<String.h>
#define CHUNKSIZE 4
char blank='#';//用于填补空余
typedef struct Chunk
{
     char ch[CHUNKSIZE];
     struct Chunk *next;
}Chunk;
typedef struct
{
     Chunk *head,*tail;//串的头和尾指针
     int curlen; // 串的当前长度
}LString;
void InitLString(LString &L)
{
      L.curlen=0;
      L.head=NULL;
      L.tail=NULL;
}
int StrAssgin(LString &L,char *chars)
{
    int i,j,k,l;
    Chunk *p,*q;
    i=strlen(chars);
    if(!i || strchr(chars,blank))
        return 0;
    L.curlen=i;
    j=i/CHUNKSIZE;
    if(i%CHUNKSIZE)
        j++;
    for(k=0;k<j;k++)
    {
        p=(Chunk *)malloc(sizeof(Chunk));
        if(!p)
            return 0;
        if(k==0)  //第一个块链
            L.head=q=p;
        else
        {
             q->next=p;
             q=p;
        }
        for(l=0;l<CHUNKSIZE&&*chars;l++)
             *(q->ch+1)=*chars++;
        if(!*chars)
        {
             L.tail=q;
             q->next=NULL;
             for(;l<CHUNKSIZE;l++)
                 *(q->ch+1)=blank;
        }
    }
    return 1;

}
void Print(LString &L)
{
     int i=0,j;
     Chunk *h;
     h=L.head;
     while(i<L.curlen)
     {
         for(j=0;j<CHUNKSIZE;j++)
            if(*(h->ch+j)!=blank)
            {
                printf("%c",*(h->ch+j));
                i++;
            }
            h=h->next;
     }
     printf("\n");
}
int main()
{
    char *s1="ABCDEFGHI",*s2="123456",*s3="";
    int k;
    LString L;
    InitLString(L);
    k=StrAssgin(L,s1);
    if(k==1)
    {
        printf("串L为:");
        Print(L);
    }
    else
        printf("出错了\n");
    return 0;
}

什么问题没有说清楚

不知道你想干什么
不过这个地方有个错误吧

int StrAssgin(LString &L,char *chars)
 {
     int i,j,k,l;
     Chunk *p,*q;
     i=strlen(chars);
     if(!i || strchr(chars,blank))
         return 0;
     L.curlen=i;
     j=i/CHUNKSIZE;
     if(i%CHUNKSIZE)
         j++;
     for(k=0;k<j;k++)
     {
         p=(Chunk *)malloc(sizeof(Chunk));
         if(!p)
             return 0;
         if(k==0)  //第一个块链
             L.head=q=p;
         else
         {
              q->next=p;
              q=p;
         }
         for(l=0;l<CHUNKSIZE&&*chars;l++)
             *(q->ch+1)=*chars++; // ch + 1 是否是ch + l？是字母l不是数字1
         if(!*chars)
         {
              L.tail=q;
              q->next=NULL;
              for(;l<CHUNKSIZE;l++)
                  *(q->ch+1)=blank;
         }
     }
     return 1;
 
}

嗯，按照yu版说的把 1改成 l就对了，另外给你写了删除的函数，申请的空间要记得释放哪

void Del(Chunk *chunk)
{
    if (!chunk)    return;
    Del(chunk->next);free(chunk);
}

void Destroy(LString &L)
{
    Del(L.head);
    L.head = L.tail = NULL;
    L.curlen = 0;
}

这种类型的结构无法销毁吧

从堆申请的空间要记得释放，简单的说，有calloc(malloc..)肯定有free