插入时就开始比较

    尾插法

    1. #define _CRT_SECURE_NO_WARNINGS 
    2. #include <stdio.h>
    3. #include<stdlib.h>
    4. #include<math.h>
    5. #include<string.h>
    6. #include<stdbool.h>
    7. typedef struct _student {
    9.     char name[10];
    11.     char stuNum[20];
    13.     struct _student* pnext;
    14.     //struct _student* pre=NULL;
    15. } NODE,*pNode;
    16. pNode CreateList(int n) { // 尾插法
    17.     int i;
    18.     int flag = 1;
    19.     pNode last = NULL, pnew = NULL,phead=NULL;
    20.     for (i = 0; i < n; i++) {
    21.         pnew = (pNode)malloc(sizeof(NODE));
    22.         scanf("%s", pnew->name);
    23.         scanf("%s", pnew->stuNum);
    24.         if (flag) { // 创建头结点  
    25.             phead = pnew;
    26.             last = pnew;
    27.             last->pnext = NULL;
    28.             flag = 0;
    29.         }
    30.         else
    31.         {
    32.             if (pnew != NULL) {
    33.                 pnew->pnext = NULL;
    34.                 last->pnext = pnew;
    35.                 last = pnew;
    36.             }
    37.         }
    39.     }
    40.     return phead;
    41. }
    42. pNode duplicate(pNode p) {
    43.     //pNode head = p;
    44.     pNode tmp = p;
    45.     while(tmp!=NULL){
    46.         while(p->pnext!=NULL) {
    47.             if (strcmp(tmp->stuNum, p->pnext->stuNum) == 0) {
    48.                 p->pnext = p->pnext->pnext;
    49.             }
    50.             else
    51.                 p = p->pnext;
    52.         }
    53.         tmp = tmp->pnext;
    54.     }
    55.     return p;
    56. }
    57. void PrintList(pNode p, int pos) {
    58.     int i = 0;
    59.     //for (i = 0; i < pos; i++)p = p->pnext;
    60.     while (p!=NULL)
    61.     {
    62.         printf("%s %s\n", p->name, p->stuNum);
    63.         p = p->pnext;
    64.     }
    66. }
    67. int main() {
    68.     int n;
    69.     scanf("%d", &n);
    70.     pNode head = CreateList(n);
    71.     duplicate(head);
    72.     PrintList(head, n);
    73. }