案例3-1.9-银行业务队列简单模拟-编程题

解题代码

#include<stdlib.h>
#include<stdio.h>
typedef struct queue* pqu;
struct queue {
	int* data;
	int front, rear;
};
void Inject(pqu A, pqu B, int N);
void Pop(pqu A, pqu B);
int main()
{
	int N;//n of people of A & B
	scanf("%d", &N);
	pqu A = (pqu)malloc(sizeof(struct queue));
	pqu B = (pqu)malloc(sizeof(struct queue));
	Inject(A, B, N);
	Pop(A, B);
	return 0;
}
void Inject(pqu A,pqu B, int N) {
	A->data = malloc(1000 * sizeof(int));
	B->data = malloc(1000 * sizeof(int));
	A->front = 0; B->front = 0; A->rear = 0; B->rear = 0;
	int i;
	int temp_index;
	for (i = 0; i < N; i++) {
		scanf("%d", &temp_index);
		if (temp_index % 2) A->data[A->rear++] = temp_index;
		else B->data[B->rear++] = temp_index;
	}
}
void Pop(pqu A, pqu B) {
	int flag = 1;
	while (A->rear != A->front || B->rear != B->front) {
		if (A->rear != A->front) {
			if (flag) flag = 0;
			else printf(" ");
			printf("%d", A->data[A->front++]);
		}
		if (A->rear != A->front) {
			if (flag) flag = 0;
			else printf(" ");
			printf("%d", A->data[A->front++]);
		}
		if (B->rear != B->front) {
			if (flag) flag = 0;
			else printf(" ");
			printf("%d", B->data[B->front++]);
		}
	}
}

测试结果

问题整理

1.不难。