问题描述:一串有ABC随意组合的字符串,判断里面是否包含连续三个不同的字符
例:ABABBABBA不满足要求 ABCBABABBAAC 满足要求
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string str;
cin>>str;
int length1=str.length();
for(int i=0;i+2<length1;i++)
{
cout<<str[i]<<str[i+1]<<str[i+2]<<endl;
if((str[i]!=str[i+1])&&(str[i]!=str[i+2])&&(str[i+1]!=str[i+2]))
{
cout<<"got it"<<endl;
return 1;
}
}
cout<<"not find"<<endl;
return 0;
}