1 #include
2 using namespace std;
3 void bijiao(int num[])
4 {
5 int count_1=0,count_2=0,count_3=0;//计水王出现的次数
6 int king_1=0,king_2=0,king_3=0;//用来计为水王
7 //循环用来找水王
8 for(int i=0;i<9;i++)
9 {
10 if(count_1==0&&king_2!=num[i]&&king_3!=num[i])//用来找第一个水王
11 {
12 count_1=1;
13 king_1=num[i];
14 }
15 else if(count_2==0&&king_1!=num[i]&&king_3!=num[i])//用来找第二个水王
16 {
17 count_2=1;
18 king_2=num[i];
19 }
20 else if(count_3==0&&king_1!=num[i]&&king_2!=num[i])//用来找第三个水王
21 {
22 count_3=1;
23 king_3=num[i];
24 }
25 else
26 {
27 if(num[i]==king_1)//判断水王是否再次出现
28 {
29 count_1+=1;
30 }
31 else if(num[i]==king_2)
32 {
33 count_2+=1;
34 }
35 else if(num[i]==king_3)
36 {
37 count_3+=1;
38 }
39 else
40 {
41 //如果三个水王和num[i]都不匹配，则将所有的水王的数量减一
42 count_1--;
43 count_2--;
44 count_3--;
45 //保证count的值要大于0
46 if(count_1<0)
47 {
48 count_1=0;
49 }
50 if(count_2<0)
51 {
52 count_2=0;
53 }
54 if(count_3<0)
55 {
56 count_3=0;
57 }
58 }
59 }
60
61 }
62 cout<<"第一个水王："<<king_1<<endl;
63 cout<<"第二个水王："<<king_2<<endl;
64 cout<<"第三个水王："<<king_3<<endl;
65 }
66 int main()
67 {
68 int num[9]={12,12,33,22,12,33,45,45,1};
69 cout<<"水王的ID："<<endl;
70 for(int i=0;i<9;i++)
71 {
72 cout<<num[i]<<" ";
73
74 }
75 cout<<endl;
76 bijiao(num);
77 }