PTA数据结构与算法题目集(中文) 7-18

 1 #define _CRT_SECURE_NO_WARNINGS
 2 #include<stdio.h>
 3 #define Size 1000
 4 int Queue[Size];
 5 int Rear = 0;
 6 int Front = 1;
 7 int size;
 8 int Succ(int num)
 9 {
10     if (num == Size)
11         return 0;
12     else
13         return num;
14 }
15 void EnQueue(int num)
16 {
17     Rear = Succ(Rear + 1);
18     Queue[Rear] = num;
19     size++;
20 }
21 int DeQueue()
22 {
23     int num = Queue[Front];
24     Front = Succ(Front + 1);
25     size--;
26     return num;
27 }
28 int IsEmpty()
29 {
30     return size == 0;
31 }
32 
33 int main()
34 {
35     int sum,sum1;
36     int N=0, M=0;
37     int A[1000] = { 0 };
38     int B[1000] = { 0 };
39     scanf("%d", &sum);
40     sum1 = sum;
41     while (sum--)
42     {
43         int num;
44         scanf("%d", &num);
45         if (num % 2)
46             A[N++] = num;
47         else
48             B[M++] = num;
49     }
50     int i = 0, j = 0;
51     while (i<N||j<M)
52     {
53         for(int k=2;k>0&&i<N;k--)
54         {
55             EnQueue(A[i]);
56             i++;
57         }
58         if (j<M)
59         {
60             EnQueue(B[j]);
61             j++;
62         }
63     }
64     int Flag = 0;
65     while (!IsEmpty())
66     {
67         if (Flag == sum1 - 1)
68             break;
69         printf("%d ", DeQueue());
70         Flag++;
71     }
72     printf("%d", DeQueue());
73     return 0;
74 }