Найти наибольшее общее слово - C++ - Ответ 4328612

//Two files of texts are given. Find the longest common word which both of them contain.
 
#include <iostream>
#include <fstream>
using namespace std;
 
//--------------------------------------------------------------------------------------
//function checks if the given character is a delimiter
//returns 1 if it is, 0 - if not
//--------------------------------------------------------------------------------------
int isDelimiter(char c)
{   int i=0;
    char delimiters [] = {' ','.',',','-',':',';','!','?',
                        '(',')','{','}','[',']','<','>','\'','"'};
    while(delimiters[i])
        if(c == delimiters[i++])
            return 1;
    return 0;
}
 
//--------------------------------------------------------------------------------------
//procedure creates list of unique words found in the given file
//the list is kept in another file
//--------------------------------------------------------------------------------------
void listOfWords(fstream &fText, const char *fWordsName)
{   char word[50], compare[50];
    int i, cur, onlyDelims, isIn;
    fstream fWords;
    
    fWords.open (fWordsName, fstream::in|fstream::out|fstream::trunc);
    if(!fWords)
    {   cout<<"Error creating file for words\n";
        cin.get();
        exit(1);
    }
 
    while(fText)
    {   fText>>word;
 
        cur = 0;    i=0;    onlyDelims = 0;
        while(word[cur] && isDelimiter(word[cur]))
            cur++;
        if (cur == strlen(word))
            onlyDelims = 1; //the whole word of delimiters, to be ignored
    
    if(!onlyDelims)
      { //peel from left
         while (word[i+cur])
            word[i++] = word[i+cur];
        word[i] = '\0';
        
        //peel from right
        i = strlen(word)-1;
        while(i>-1 && isDelimiter(word[i]) )
            word[i--] = '\0';
        
        //tolower
        i = 0;
        while (word[i])
            word[i++] = tolower(word[i]);
 
        //word processed -> is unique?
        isIn = 0;
        fWords.seekg(0,fWords.beg);
        while(fWords)
        {   fWords>>compare;
            if(strcmp(compare,word)==0)
            {   isIn = 1;
                break;
            }
        }
        fWords.clear(); //cleaning eof()
        
        //word processed and unique-> out
        if(!isIn)
        {   fWords.seekp(0,fWords.end);
            fWords<<word<<"\n";
        }
      }//if
    }//while
    fWords.close();
}
 
//--------------------------------------------------------------------------------------
//procedure finds common words in the two given files with lists of words
//the list of common words is kept in another file
//--------------------------------------------------------------------------------------
void findCommons(const char *fW1Name, const char *fW2Name, const char *fCommonName)
{   fstream fCommon, fW1, fW2;
    
    fCommon.open (fCommonName, fstream::out|fstream::trunc);
    fW1.open (fW1Name, fstream::in);
    fW2.open (fW2Name, fstream::in);
 
    if(!(fCommon && fW1 && fW2))
    {   cout<<"Error processing files for common words\n";
        cin.get();
        exit(1);
    }
 
    char word1[50], word2[50];
 
    while(fW1)
    {   fW1>>word1;
        fW2.seekg(0,fW2.beg);
        while(fW2)
        {   fW2>>word2;
            if(strcmp(word1,word2)==0)
                fCommon<<word1<<"\n";
        }
        fW2.clear();
    }
 
    fCommon.close();
    fW1.close();
    fW2.close();
}
 
//--------------------------------------------------------------------------------------
//function returns the longest word in the given file with 
//list of words
//--------------------------------------------------------------------------------------
char *findTheLongestWord(const char *fName)
{   fstream f;
    f.open(fName, fstream::in);
 
    if(!f)
    {   cout<<"Error opening file\n";
        cin.get();
        exit(1);
    }
 
    char word[50], res[50];
    unsigned int max = 0;
    while(f)
    {   f>>word;
        if(strlen(word)>max)
        {   max = strlen(word);
            strcpy(res,word);
        }
    }
    f.close();
 
    char *back = new char[strlen(res)];
    strcpy(back,res);
    return back;
}
 
//--------------------------------------------------------------------------------------
//MAIN
//--------------------------------------------------------------------------------------
int main()
{   fstream f1,f2;
    f1.open ("file1.dat", fstream::in);
    f2.open ("file2.dat", fstream::in);
    
    if( !(f1 && f2))
    {   cout<<"Error opening files with texts\n";
        cin.get();
        exit(1);
    }
 
    listOfWords(f1,"word1.dat");
    listOfWords(f2,"word2.dat");
    f1.close();
    f2.close();
 
    findCommons("word1.dat", "word2.dat", "common.dat");
    cout<< "The longest word found in the both files: "<<findTheLongestWord("common.dat");
    
    cin.get();
    return 0;
}