void calculate(const char* str,int* max0,int * max1)
{
int temp0 = 0; //保存连续是'0'的最大长度
int temp1 = 0; //保存连续是'1'的最大长度
while (*str) //遍历01字符串
{
if (*str == '0') //当前字符串是'0'
{
(*max0)++;
if (*(++str) == '1') //如果下一个字符是'1'
{
if (temp0 < *max0) //判断当前最大长度是否需要保存
{
temp0 = *max0;
}
*max0 = 0;
}
}
else if (*str == '1')
{
(*max1)++;
if (*(++str) == '0')
{
if (temp1 < *max1)
{
temp1 = *max1;
}
*max1 = 0;
}
}
}
*max0 = *max0 > temp0 ? *max0 : temp0;
*max1 = *max1 > temp1 ? *max1 : temp1;
}
int main()
{
char str[] = "00000010000000000";
int max0 = 0;
int max1 = 0;
calculate(str,&max0,&max1);
cout << max0 << " " << max1 << endl;
system("pause");
return 0;
}
Find the maximum number of 01 strings of consecutive 0s and 1s
Guess you like
Origin blog.csdn.net/lpl312905509/article/details/104088415
Recommended
Ranking