题解 | 穷哈哈~
穷哈哈~
https://www.nowcoder.com/practice/5b3184b233f34fb39a7f259ae82eb42c
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using i128=__int128_t;
using u128=__uint128_t;
using ld=long double;
void solve()
{
int n,a=0,h=0,MAX=0;
cin >> n;
string s;
cin >> s;
for(int i=0;i<s.size();i++)//看字符串中是否有a或h 从而判断MAX的初始值
{
if(s[i]=='a'||s[i]=='h')
{
MAX=1;
break;
}
}
for(int i=0,j=0;i<s.size()&&j<s.size()-1;) //双指针扫一遍 判断是不是ah交替出现
{
if((s[j]=='a'&&s[j+1]=='h')||(s[j]=='h'&&s[j+1]=='a'))
{
MAX=max(MAX,j-i+2);
j++;
}
else
{
j=i=j+1;
}
//cout << MAX <<"\n";
}
cout << MAX;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t=1;
//cin >> t;
while(t--)
{
solve();
}
return 0;
}
查看5道真题和解析
