数据结构实验之链表六:有序链表的建立
Time Limit: 1000 ms Memory Limit: 65536 KiB
Problem Description
输入N个无序的整数,建立一个有序链表,链表中的结点按照数值非降序排列,输出该有序链表。
Input
第一行输入整数个数N;
第二行输入N个无序的整数。
Output
依次输出有序链表的结点值。
Sample Input
6 33 6 22 9 44 5
Sample Output
5 6 9 22 33 44
Hint
不得使用数组!
示例代码如下:
#include <bits/stdc++.h>
using namespace std;
struct node
{
int data;
struct node *next;
} *head, *p, *q, *tail;
int main()
{
int N;
while(~scanf("%d", &N))
{
head = (struct node *)malloc(sizeof(struct node));
head->next = NULL;
p = (struct node *)malloc(sizeof(struct node));
scanf("%d", &p->data);
p->next = head->next;
head->next = p;
N--;
while(N--)
{
p = (struct node *)malloc(sizeof(struct node));
p->next = NULL;
scanf("%d", &p->data);
tail = head;
q = head->next;
while(q)
{
if(p->data < q->data)
{
p->next = tail->next;
tail->next = p;
break;
}
else if(p->data >= q->data && q->next == NULL) // 来处理大于等于当前数据的元素
{
p->next = q->next;
q->next = p;
break;
}
tail = q;
q = q->next;
}
}
p = head->next;
while(p)
{
printf("%d%c", p->data, p->next?' ':'\n');
p = p->next;
}
}
return 0;
}