단일 링크 는 개인 주소록 관리 조 수 를 실현 한다.

#include
#include
#include
using namespace std;

struct Phone
{
 char name[10];            //  
 char number[12];         //    
 char add[30];           //  
 char post[20];         //  
 int age;              //  
 char sex[2];         //  
 char QQ[11];        //QQ
 char weixin[11];   //  
 char birth[20];   //  
 struct Phone *next;
};

typedef struct Phone Node;
typedef Node *pNode;

void Check(pNode pHead)
{
 pNode ptr;
 ptr=pHead;
 char ckName[10];
 cout<>ckName;
 while (ptr)
 {
  if (strcmp(ptr->name,ckName)==0)//strcmp            
  {
   cout<number<next;
   cout<>newnode->name;
 cout<>newnode->number;
  cout<>newnode->add;
  cout<>newnode->post;
  cout<>newnode->age;
  cout<>newnode->sex;
  cout<>newnode->QQ;
  cout<>newnode->weixin;
   cout<>newnode->birth;

 if (pHead)
 {
  ptr=pHead;
  while (ptr->next)
  {
   ptr=ptr->next;
  }
  newnode->next=NULL;
  ptr->next=newnode;
 }
 else
 {
  newnode->next=pHead;
  pHead=newnode;
  ptr=pHead;
 }
 cout<name<number<add;
  cout<post<age<sex;
  cout<QQ<weixin<birth<next;
 }
}

void DeleteItem(pNode &pHead)
{
 pNode ptr,pBefore;
 ptr=pBefore=pHead;
 char ckName[10];
 cout<>ckName;
    while (ptr!=NULL)
    {
  if (strcmp(ptr->name,ckName)==0)
  {
   break;
  }
  else
  {
   pBefore=ptr;
   ptr=ptr->next;
  }
    }

 if (ptr)
 {
  if (ptr==pHead)
  {
   pHead=ptr->next;
   delete ptr;
  }
  else
  {
   pBefore->next=ptr->next;
   delete ptr;
  }
  cout<>user;
    cout<>password;
  if(strcmp(user,"12345")==0&&strcmp(password,"12345")==0)
   {

    cout<                       |"<                       |"<                       |"<                       |"<                         |"<>iChoice)
 {
  switch (iChoice)
  {
  case 1:
   AddNewItem(pHead);//    
   break;
  case 2:
   cout<                       |"<                       |"<                       |"<                       |"<                         |"<