统计单词

输出一句话中最短和最长的单词

#include<iostream>  
#include<queue>  
#include<vector>  
#include<stack>  
#include<algorithm>
#include<cmath> 
#include<set>
#include<cstring>
using namespace std;  
int main(){
	char str[20202];
	cin.getline(str,20010);
	int len=strlen(str);
	
	string maxn="",minn=""; 
	
	int max_len=-9999;
	int min_len=9999;
	
	for(int i=0;i<len;i++)
	{
		string fz=""; 
		for(int j=i;j<len&&str[j]!=' '&&str[j]!=',';j++,i++)
		{
			fz+=str[j];
		}
		if(fz.size()>max_len)
		{
			max_len=fz.size();
			maxn=fz;
		}
		if(fz.size()==0) 
		      continue;
		if(fz.size()<min_len)
		{
			min_len=fz.size();
			minn=fz;
		}
	}
	cout<<minn<<endl;
	return 0;
}

  

posted @ 2018-11-12 13:48  道微真理  阅读(162)  评论(0编辑  收藏  举报