9-16.txt

C++完美演绎 经典算法 如 /* 头文件：my_Include.h */ #include <stdio.h> /* 展开C语言的内建函数指令 */ #define PI 3.141

/* 范例：9-16（以VC++执行，请参考范例光盘源代码中的说明）*/
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>

struct person
{
  char name[30];
  int age;
  person *next;
};

person *start, *nowper, *newper;	/* 步骤一 */

void main(void)
{
  char agestr[5];	/* 年龄以字符串方式输入 */
  clrscr();		/* 清屏 */

  do
  {
    newper = (person *)malloc(sizeof(person));	
    if (start==0) 								/* 步骤二 */
      start = nowper = newper;
    else
    {
      nowper = start;			/* 将目前指针指向开头 */
      while(nowper->next != (person *)NULL)
        nowper = nowper->next ;	/* 找链表尾端 */
      nowper->next = newper;	/* 将原链表尾指向新节点 */
      nowper = newper;
    }

    printf("\n输入姓名:");   gets(nowper->name);
    printf("\n输入年龄:");   gets(agestr);
    nowper->age = atoi(agestr);
    nowper->next = (person *)NULL;	/* 链表尾端指向NULL */

    printf("是否继续  是(y)否(n)? ");
  }while(getche()!='n');

  nowper = start;	/* 从头输出 */
  clrscr();
  do
  {
    printf("\n姓名:%s   年龄:  %d", \
         nowper->name,nowper->age);
    nowper = nowper->next ;	/* 移到下一节点输出 */
  }while(nowper != (person *)NULL);

  getchar();
}