链表函数（建立，删除重复元素，排序，输出）—

链表函数（建立，删除重复元素，排序，输出）—— 链表的有序集合

阅读量：4973 次

发布时间：2019-06-12

本文共 2337 字，大约阅读时间需要 7 分钟。

/**************************************      Problem id    : SDUT OJ 2178       User name    : Silence-Debug       Result        : Accepted       Take Memory    : 316K       Take Time    : 0MS       Submit Time    : 2013-05-31 21:05:15    **************************************/ # include 
      
        # include 
       
            struct node  {      int date;      struct node *next;  } ;    struct node *creat(int n)  {      struct node *head, *tail, *p;      head = (struct node *)malloc(sizeof(struct node));      head -> next = NULL;      tail = head;      for(int i = 0; i < n; i++)      {          p = (struct node *)malloc(sizeof(struct node));          scanf("%d", &p -> date);          p -> next = NULL;          tail -> next = p;          tail = p;      }      return head;  }    void Delete(struct node *&head, int n)  {      struct node *p, *q, *t, *tail;      p = head -> next;      while(p)      {          q = p->next;          t = p;          while(q)          {              tail = q;              if (p -> date == q -> date)              {                  n--;                  t -> next = q -> next;                  q = q -> next;                  free(tail);              }              else              {                  q = q->next;                  t = t->next;              }          }          p = p -> next;      }    }    void sortline(struct node *&head, int n)  {      struct node *p, *q;      while(n--)      {          p = head -> next;          q = p -> next;          while(p -> next)          {              if(p -> date > q -> date)              {                  int t = p -> date;                  p -> date = q -> date;                  q -> date = t;              }              p = p -> next;              q = q -> next;          }      }  }    void output(struct node *head)  {      struct node *r = head;      while(r -> next -> next != NULL)      {          printf("%d ", r -> next -> date);          r = r -> next;      }      printf("%d\n", r -> next -> date);  }    int main(void)  {      int n;      while(~scanf("%d", &n))      {          struct node *head;          head = creat(n);          Delete(head, n);          sortline(head, n);          output(head);      }        return 0;  }

View Code

转载于:https://www.cnblogs.com/Silence-AC/archive/2013/05/31/3111179.html

你可能感兴趣的文章

类对象

查看>>

[Voice communications] 声音的滤波

查看>>

SQL语言之概述（一）

查看>>

软件建模——第9章毕业论文管理系统—面向对象方法

查看>>

[SDOI2008]洞穴勘测