![]() |
#2
zklhp2012-08-04 23:35
|

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
const int n = 5;
typedef struct LinkLNdoe
{
int no;
int Data;
struct LinkLNode *next;
}LinkLNode,*LinkList;
LinkLNode *head,*end;
LinkLNode *Array_FirstLinkListCreat( LinkList &L,int m )
{
int i = 0,j = 0;
LinkLNode *Array[n+1];
LinkLNode *p = NULL,*q = NULL;
for( i = 1;i <= n;i++ )
{
p = q = l = (LinkLNode *)malloc(sizeof(LinkLNode));
Array[i] = p;
p->no = 1;
head = end = p;
}
for( i = 1;i <= n;i++ )
{
for( j = 2;j <= m ;j++ )
{
q = l = (LinkLNode *)malloc(sizeof(LinkLNode));
q->no = j;
end->next = q;
end = p = q;
end->next = NULL;
}
}
return (Array[1]);
}
int main ()
{
LinkList L;
LinkLNode *p,*q;
int m = 3;
int i = 0,j = 0;
p = Array_FirstLinkListCreat( L,m );
system("pause");
return 0;
}
#include <malloc.h>
#include <stdlib.h>
const int n = 5;
typedef struct LinkLNdoe
{
int no;
int Data;
struct LinkLNode *next;
}LinkLNode,*LinkList;
LinkLNode *head,*end;
LinkLNode *Array_FirstLinkListCreat( LinkList &L,int m )
{
int i = 0,j = 0;
LinkLNode *Array[n+1];
LinkLNode *p = NULL,*q = NULL;
for( i = 1;i <= n;i++ )
{
p = q = l = (LinkLNode *)malloc(sizeof(LinkLNode));
Array[i] = p;
p->no = 1;
head = end = p;
}
for( i = 1;i <= n;i++ )
{
for( j = 2;j <= m ;j++ )
{
q = l = (LinkLNode *)malloc(sizeof(LinkLNode));
q->no = j;
end->next = q;
end = p = q;
end->next = NULL;
}
}
return (Array[1]);
}
int main ()
{
LinkList L;
LinkLNode *p,*q;
int m = 3;
int i = 0,j = 0;
p = Array_FirstLinkListCreat( L,m );
system("pause");
return 0;
}