学步园

/**<br /> * c语言实现正序链表的创建(不使用头结点);<br /> */</p> <p>#include <stdio.h><br /> #include <malloc.h></p> <p>typedef struct node {<br /> int data;<br /> struct node *next;<br /> }ArrayNode, *ArrayPoint;</p> <p>void swop(int a[], int aLength) {</p> <p> ArrayPoint head, p, q;</p> <p> for(int i=0; i<aLength; i++) {<br /> if(i==0) {<br /> p = (ArrayPoint)malloc(sizeof(ArrayNode));<br /> head = p;<br /> p->data = a[i];<br /> } else {<br /> p->next = (ArrayPoint)malloc(sizeof(ArrayNode));<br /> p = p->next;<br /> p->data = a[i];<br /> }</p> <p> }<br /> /*链表的打印*/<br /> printf("链表数组为： /n");<br /> for(int i=0; i<aLength; i++) {<br /> printf("%d/n",head->data);<br /> head = head->next;<br /> }<br /> }</p> <p>main() {<br /> void swop(int a[], int aLength);<br /> int a[] = {2,3,5,6,7,8,11,13,15,19};<br /> int b[] = {1,2,4,5,7,9,10,12,14,20};</p> <p> swop(a, 10);<br /> swop(b, 10);<br /> }</p> <p>