题意
题目提供数个结点和链表的头,要求将链表上的结点按照其数据大小有序输出
题目注意点
- 要判断结点是否在链表上
- 当没有有效结点时要特判输出0 -1
- 注意-1不需要用%05d控制输出
实现
#include <stdio.h>
#include <algorithm>
using namespace std;
#define maxSize 100020
struct Node {
int addresse;
int data;
int next;
int flag;//是否在链表上
}node[maxSize];
bool cmp(Node a, Node b) {
if (a.flag != b.flag) return a.flag > b.flag;
else return a.data < b.data;
}
int main() {
//对node数组初始化
for (int i = 0; i < maxSize; i++) {
node[i].data = maxSize;
node[i].flag = 0;
}
int head, n, count = 0;//count为有效节点的数目
scanf("%d%d", &n, &head);
for (int i = 0; i < n; i++) {
int add, num, next;
scanf("%d%d%d", &add, &num, &next);
node[add].addresse = add;
node[add].data = num;
node[add].next = next;
}
for (int p = head; p != -1; p = node[p].next) {
node[p].flag = 1;
count++;
}
sort(node, node + maxSize, cmp);
if (count == 0) {
printf("0 -1\n");
} else {
printf("%d %05d\n", count, node[0].addresse);
for (int i = 0; i < count-1; i++) {
printf("%05d %d %05d\n", node[i].addresse, node[i].data, node[i+1].addresse);
}
printf("%05d %d -1\n", node[count-1].addresse, node[count-1].data);
}
return 0;
}