poj 1951 Extra Krunch 字符串处理水题

//poj 1951
//sep9
#include <iostream>
using namespace std;
bool vis[256];
char str[1024],ans[1024];

int main()
{
	gets(str);
	memset(vis,0,sizeof(vis));
	int cur=0;
	for(int i=0;i<strlen(str);++i){
		if(str[i]=='A'||str[i]=='E'||str[i]=='I'||str[i]=='O'||str[i]=='U')
			continue;
		if(str[i]==' '){
			if(cur!=0&&ans[cur-1]!=' ')
		 		ans[cur++]=' ';
		}else if(str[i]>='A'&&str[i]<='Z'){
			if(!vis[str[i]-'A']){
				ans[cur++]=str[i];
				vis[str[i]-'A']=true;
			}
		}else{
			if(cur>0&&ans[cur-1]==' '){
				--cur;
			}
			ans[cur++]=str[i];
		}
	}	
	ans[cur]='\0';
	printf("%s",ans);
	return 0;	
}