题目
【1133】链表、链表调整顺序、vector拼接
【1097】链表拆分、合并
【1074】链表翻转(😀)
【1052】链表遍历+排序(😀)
【1032】链表判断是否有相同的后缀
【1133】链表、链表调整顺序、vector拼接
1133 Splitting A Linked List (25 分)
(1)将节点按照顺序保存在vector中,根据每个结点的address和它下一个节点的地址next
(2)vector拼接
(3)注意最后遍历的是v.size(),不是n!!因为在v.push_back阶段,是将满足条件的点输入到v中,不一定有n个
#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
struct node{
int address, data, next;
};
int main(){
int root, n, k, a, b, c;
cin>>root>>n>>k;
unordered_map<int, node> m;
vector<node> v, v1, v2, v3;
// 输入map<int, node> 节点的address:节点
for(int i=0; i<n; i++){
scanf("%d %d %d", &a, &b, &c);
m[a] = node{a,b,c};
}
// 将节点按照顺序保存在v中
for(; root!=-1; root=m[root].next){
v.push_back(m[root]);
}
// 按照条件分别保存在v1, v2, v3中,合并三个vector
for(int i=0; i<n; i++){
if(v[i].data>k){
v1.push_back(v[i]);
}else if(v[i].data<=k && v[i].data>=0){
v2.push_back(v[i]);
}else{
v3.push_back(v[i]);
}
}
v3.insert(v3.end(),v2.begin(),v2.end());
v3.insert(v3.end(),v1.begin(),v1.end());
// 输出
for(int i=0; i<v3.size(); i++){
if(i==n-1) printf("%05d %d -1\n", v3[i].address, v3[i].data);
else printf("%05d %d %05d\n", v3[i].address, v3[i].data, v3[i+1].address );
}
}
#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
struct node{
int address, data, next;
// node* next_node;
};
int main(){
int root, n, k, a, b, c;
cin>>root>>n>>k;
unordered_map<int, node> m;
vector<node> v, ans;
for(int i=0; i<n; i++){
scanf("%d %d %d", &a, &b, &c);
m[a] = node{a,b,c};
}
for(; root!=-1; root=m[root].next){
v.push_back(m[root]);
}
for(int i=0; i<v.size(); i++){
if(v[i].data<0)
ans.push_back(v[i]);
}
for(int i=0; i<v.size(); i++){
if(v[i].data<=k && v[i].data>=0)
ans.push_back(v[i]);
}
for(int i=0; i<v.size(); i++){
if(v[i].data>k)
ans.push_back(v[i]);
}
for (int i = 0; i < ans.size() - 1; i++)
printf("%05d %d %05d\n", ans[i].address, ans[i].data, ans[i + 1].address);
printf("%05d %d -1\n", ans[ans.size() - 1].address, ans[ans.size() - 1].data);
}
【1097】链表拆分、合并
#include<iostream>
#include<algorithm>
#include<vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
const int maxn = 100000;
struct node{
int address, data, next, num = 2*maxn;
};
int main(){
// 输入
int root, n, a, b, c, cnt=0;
cin>>root>>n;
unordered_map<int, node> m;
vector<node> v, tmp;
unordered_set<int> s;
for(int i=0; i<n; i++){
scanf("%d %d %d", &a, &b, &c);
m[a] = node{a,b,c};
}
// 将所有的节点拆分成两部分,v和tmp
for(int i=root; i!=-1; i=m[i].next){
int value = abs(m[i].data);
if(s.find(value)==s.end()){
v.push_back(m[i]);
cnt++;
}else{
tmp.push_back(m[i]);
}
s.insert(value);
}
// v和tmp合并,并输出
v.insert(v.end(), tmp.begin(), tmp.end());
for(int i=0; i<v.size(); i++){
if(i==(cnt-1)||i==v.size()-1){
printf("%05d %d -1\n", v[i].address, v[i].data);
}else{
printf("%05d %d %05d\n", v[i].address, v[i].data, v[i+1].address);
}
}
return 0;
}
【1032】链表判断是否有相同的后缀
/* 23分 一个测试点不通过
#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
struct node{
int address;
char val;
int next;
};
int main(){
int r1, r2, n, add, next;
char value;
cin>>r1>>r2>>n;
unordered_map<int, node> m;
vector<node> v1, v2;
for(int i=0; i<n; i++){
cin>>add>>value>>next;
m[add] = node{add, tolower(value), next};
}
for(int i=r1; i!=-1; i=m[i].next){
v1.push_back(m[i]);
}
for(int i=r2; i!=-1; i=m[i].next){
v2.push_back(m[i]);
}
if(v2.size()==0 || v1.size()==0){
printf("-1");
return 0;
}
reverse(v1.begin(), v1.end());
reverse(v2.begin(), v2.end());
int j=0;
while(v1[j].address==v2[j].address && j<v1.size() && j<v2.size()) j++;
if(j!=v1.size() && j!=v2.size() && j>0) printf("%05d",v1[j-1].address);
else printf("-1");
return 0;
}
*/
#include <cstdio>
using namespace std;
struct NODE {
char key;
int next;
bool flag;
}node[100000];
int main() {
int s1, s2, n, a, b;
scanf("%d%d%d", &s1, &s2, &n);
char data;
for(int i = 0; i < n; i++) {
scanf("%d %c %d", &a, &data, &b);
node[a] = {data, b, false};
}
for(int i = s1; i != -1; i = node[i].next)
node[i].flag = true;
for(int i = s2; i != -1; i = node[i].next) {
if(node[i].flag == true) {
printf("%05d", i);
return 0;
}
}
printf("-1");
return 0; }