題目大意:
其實就是找tabs個數和trailing spaces個數。
解題思路:
水題一道,話不多說
代碼如下:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX=;
char str[MAX];
int main()
{
int n,len,i,tab,trail,j,ans;
scanf("%d",&n);
getchar();
for(i=;i<n;i++)
{
tab=;ans=;trail=;
while(gets(str))
{
if(strcmp(str,"##")==)
break;
trail=;
len=strlen(str);
for(j=;j<len;j++)
{
if(str[j]=='\t')
{
tab++;
trail+=;
continue;
}
else if(str[j]==' ')
{
trail++;
continue;
}
trail=;
}
ans+=trail;
}
printf("%d tab(s) replaced\n", tab);
printf("%d trailing space(s) removed\n", ans);
}
return ;
}