一、链表操作 1.链表(Linked list)是由多个节点组成的,在逻辑上可看作连续的串。 2.链表可分为单向链表、循环链表、双向链表几种。 3.添加和删除比数组容易,效率更高。 二、Simple Code: /******************************************************************** * * LinkList.cpp : * 1)实现链表的创建,输出 * * Author :ZengZhiHeng * Date :2010-12-27 * ***********************************************************************/ #include "stdafx.h" #include "stdio.h" #include "string.h" #include "malloc.h" #include "conio.h" //getche head file void OutLinkList(); void CreateLinkList(); struct Student { int id; char *name; struct Student *next; }; Student *head; int _tmain(int argc, _TCHAR* argv[]) { CreateLinkList(); OutLinkList(); getche(); return 0; } //创建链表 void CreateLinkList() { Student *stu,*p; head = (Student*)malloc(sizeof(Student)); //链表头 p = (Student*)malloc(sizeof(Student)); head = p; for(int i=1;i<=10;i++) { stu = (Student*)malloc(sizeof(Student)); stu->id = i; stu->name ="Jet"; stu->next = NULL; p->next = stu; p = p->next; } } //输出链表 void OutLinkList() { Student *p; p = head->next; while(p!=NULL) { printf("ID=%d/n",p->id); printf("Name=%s/n",p->name); p=p->next; } }