纪念一下这个简单却改了好几遍的小代码。。。

Write a program to read strings from standard input looking for duplicated words. The program should find places in the input where one word is followed immediately by itself. Keep track of the largest number of times a single repetition occurs and which word is repeated.

Print the maximum number of duplicates, or else print a message saying that no word was repeated. For example, if the input is

how now now now brown cow cow
the output should indicate that the word now occurred three times.

    string s;

    vector<string> vs;
    while (cin>>s)
    {
        vs.push_back(s);
    }
    auto beg=vs.begin();
    string prevStr=*beg;
    string mostStr;
    int maxCount=0,count=0;
    for (;beg!=vs.end() ;++beg )
    {
        if (prevStr==*beg)
        {
            ++count;
        }
        else
            count=1;

        if (count>maxCount)
        {
            maxCount=count;
            mostStr=prevStr;
        }
        prevStr=*beg;

    }
    cout<<maxCount<<" times "<<mostStr<<" occurs"<<endl;


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值