AcWing 774. 最长单词
原题链接
中等
作者:
Penn_Lam
,
2024-01-20 17:21:24
,
所有人可见
,
阅读 32
#include <iostream>
using namespace std;
const int num =500;
string s[num];
int main()
{
int cnt=0, max=0, idex=0, len, Len;
for(int i = 0,j = -1; i<500; i++,j++){
cin >> s[i];
len = s[i].size();
if(s[i][len -1]=='.') len -= 1;
cnt = len;
if(cnt > max) {
max = cnt;
idex = i;
}
if(j>0){
Len = s[j].size();
if(s[j][Len - 1]=='.') goto go;}
}
go:if(s[idex].find('.')+1 == 0) cout << s[idex] << endl;
else cout << s[idex].substr(0,s[idex].size()-1) << endl;
return 0;
}
运行时间 16ms,比高赞的更短