题意
题目提供数个结点和链表头,将其值的绝对值第一次出现的结点连成一条链表,出现多次的连成第二条链表。
题目注意点
- 输出顺序依然按照题目给出的顺序,因此需要一个记录输入是顺序的变量order
题解
再回顾一下算法笔记解此类题的思路:
①定义静态链表(的结点)
②在程序开始时初始化链表(此处对flag,appear,order进行了初始化)
③遍历链表(将不在链表上的结点,data的绝对值不是第一次出现的结点区别出来)
④用比较函数排序,按题目要求的输出顺序排序结点
⑤按照要求输出,注意处理尾结点的特殊情况
#include <stdio.h>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int hash[maxn] = {0};
struct Node {
int add, data, next;
int flag;//是否在链表上
int appear;//其data是否已经出现
int order;
}node[maxn];
bool cmp(Node a, Node b) {
if (a.flag != b.flag) return a.flag > b.flag;
else if (a.appear != b.appear) return a.appear > b.appear;
else return a.order < b.order;
}
int main() {
//初始化结点数组
for (int i = 0; i < maxn; i++) {
node[i].flag = 0;
node[i].appear = 0;
node[i].order = maxn;
}
int head, n;
scanf("%d%d", &head, &n);
for (int i = 0; i < n; i++) {
int add, data, next;
scanf("%d%d%d", &add, &data, &next);
node[add].add = add;
node[add].data = data;
node[add].next = next;
}
//遍历链表
int t = head, count = 0, countTotal = 0;
while (t != -1) {
node[t].flag = 1;//在链表上出现了
node[t].order = countTotal;//在链表上的位置
int value = abs(node[t].data);
if (hash[value] == 0) {//值还没出现过
node[t].appear = 1;
hash[value] = 1;
count++;
}
countTotal++;
t = node[t].next;
}
sort(node, node + maxn, cmp);
for (int i = 0; i < countTotal; i++) {
printf("%05d %d ", node[i].add, node[i].data);
if (i != count - 1 && i != countTotal - 1) {
printf("%05d\n", node[i + 1].add);
} else {
printf("-1\n");
}
}
return 0;
}