華為筆試題：計算字符串“010111001100....”中‘0’和‘1’連續出現的次數。

#include<iostream>;

void main() {

???char *charArray="01000111100011100111100001";
???int max[2]?? ?={0,0};
???int count[2]? ={0,0};

? while(*charArray){
??????
? int?? index???? =*charArray-'0';

? count[index]++;
??count[index^1] =0;

? if(count[index]>max[index])
?????? ?max[index]=count[index];

? charArray++;
? }
?
?std:cout<<"Max times of 0 is"<<max[0]<<std:endl;
?std:cout<<"Max times of 1 is"<<max[1]<<std:endl;
}
//~:end the codes

程序代碼的藝術化，呵呵