To commemorate this simple little code that has been modified several times...

Source: Internet
Author: User

Write a program to read strings from standard input looking for duplicated words. The program shocould 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 brown cow
The output shoshould indicate that the word now occurred three times.

String S;

Vector <string>;
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;

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.