题目链接:1075 链表元素分类
思路
- 输入链表后,设置三个带尾指针的链表分别存储三类结点,遍历一轮接在相应链表尾。
- 将3个链表相连,输出即可。
#include <iostream>
using namespace std;
struct link{
int data,next;
}L[100003];
int main(){
int head, N, K, a , h, flag;
int b[3] = {100000, 100001, 100002};//三类的尾指针
cin >> head >> N >> K;
for(int i=0;i<N;i++){
scanf("%d",&a);
scanf("%d %d", &L[a].data, &L[a].next);
}
//遍历一轮将结点接到相应类别尾指针后
h = head;
while(h != -1){
if(L[h].data < 0) flag = 0;
else if(L[h].data > K) flag = 2;
else flag = 1;
L[b[flag]].next = h;
b[flag] = h;
h = L[h].next;
}
//将三类链表相连
L[b[2]].next = -1;
L[b[1]].next = L[100002].next;
L[b[0]].next = L[100001].next;
h = L[100000].next;
while(L[h].next != -1){
printf("%05d %d %05d\n", h, L[h].data, L[h].next);
h = L[h].next;
}
printf("%05d %d -1\n", h, L[h].data);
return 0;
}