关于代码
  • 板块灌水区
  • 楼主_xbt
  • 当前回复4
  • 已保存回复4
  • 发布时间2022/12/10 15:49
  • 上次更新2023/10/26 23:55:26
查看原帖
关于代码
747748
_xbt楼主2022/12/10 15:49
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int n,t;
string a[114];
queue<string> q1;
queue<string> q2;
queue<string> q3;
queue<string> q4;
queue<string> q5;
queue<string> q6;
queue<string> q7;
queue<string> q8;
queue<string> q9;
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<n;i++){
		if(a[i][1]=='1') q1.push(a[i]);
		if(a[i][1]=='2') q2.push(a[i]);
		if(a[i][1]=='3') q3.push(a[i]);
		if(a[i][1]=='4') q4.push(a[i]);
		if(a[i][1]=='5') q5.push(a[i]);
		if(a[i][1]=='6') q6.push(a[i]);
		if(a[i][1]=='7') q7.push(a[i]);
		if(a[i][1]=='8') q8.push(a[i]);
		if(a[i][1]=='9') q9.push(a[i]);
	}
	printf("Queue1:");
	while(!q1.empty()){
		a[t]=q1.front();
		cout<<a[t]<<" ";
		t++;
		q1.pop();
	}
	printf("\nQueue2:");
	while(!q2.empty()){
		a[t]=q2.front();
		cout<<a[t]<<" ";
		t++;
		q2.pop();
	}
	printf("\nQueue3:");
	while(!q3.empty()){
		a[t]=q3.front();
		cout<<a[t]<<" ";
		t++;
		q3.pop();
	}
	printf("\nQueue4:");
	while(!q4.empty()){
		a[t]=q4.front();
		cout<<a[t]<<" ";
		t++;
		q4.pop();
	}
	printf("\nQueue5:");
	while(!q5.empty()){
		a[t]=q5.front();
		cout<<a[t]<<" ";
		t++;
		q5.pop();
	}
	printf("\nQueue6:");
	while(!q6.empty()){
		a[t]=q6.front();
		cout<<a[t]<<" ";
		t++;
		q6.pop();
	}
	printf("\nQueue7:");
	while(!q7.empty()){
		a[t]=q7.front();
		cout<<a[t]<<" ";
		t++;
		q7.pop();
	}
	printf("\nQueue8:");
	while(!q8.empty()){
		a[t]=q8.front();
		cout<<a[t]<<" ";
		t++;
		q8.pop();
	}
	printf("\nQueue9:");
	while(!q9.empty()){
		a[t]=q9.front();
		cout<<a[t]<<" ";
		t++;
		q9.pop();
	}
	printf("\n");
	for(int i=0;i<n;i++){
		if(a[i][0]=='A') q1.push(a[i]);
		if(a[i][0]=='B') q2.push(a[i]);
		if(a[i][0]=='C') q3.push(a[i]);
		if(a[i][0]=='D') q4.push(a[i]);
	}
	t=0;
	printf("QueueA:");
	while(!q1.empty()){
		a[t]=q1.front();
		cout<<a[t]<<" ";
		t++;
		q1.pop();
	}
	printf("\nQueueB:");
	while(!q2.empty()){
		a[t]=q2.front();
		cout<<a[t]<<" ";
		t++;
		q2.pop();
	}
	printf("\nQueueC:");
	while(!q3.empty()){
		a[t]=q3.front();
		cout<<a[t]<<" ";
		t++;
		q3.pop();
	}
	printf("\nQueueD:");
	while(!q4.empty()){
		a[t]=q4.front();
		cout<<a[t]<<" ";
		t++;
		q4.pop();
	}
	printf("\n");
	for(int i=0;i<n;i++) cout<<a[i]<<" ";
}

有人能帮我优化一下代码吗?

感觉很多重复的但我不会改

2022/12/10 15:49
加载中...