ACM-POJ1035 Spell checker [MyAnswer]

最新推荐文章于 2019-07-26 20:05:14 发布

原创最新推荐文章于 2019-07-26 20:05:14 发布 · 1.4k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#dictionary #string #iterator #character #input #file

算法设计专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个拼写检查程序模块的设计与实现，该模块能够通过删除、替换或插入字符的方式找到输入单词在字典中的相似正确形式，并按字典中出现顺序输出。

http://acm.pku.edu.cn/JudgeOnline/problem?id=1035

[问题描述]

Description

You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms.
If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by one of the following operations:
deleting of one letter from the word;
replacing of one letter in the word with an arbitrary letter;
inserting of one arbitrary letter into the word.
Your task is to write the program that will find all possible replacements from the dictionary for every given word.

Input

The first part of the input file contains all words from the dictionary. Each word occupies its own line. This part is finished by the single character '#' on a separate line. All words are different. There will be at most 10000 words in the dictionary.
The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by the single character '#' on a separate line. There will be at most 50 words that are to be checked.
All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and each one contains 15 characters at most.

Output

Write to the output file exactly one line for every checked word in the order of their appearance in the second part of the input file. If the word is correct (i.e. it exists in the dictionary) write the message: " is correct". If the word is not correct then write this word first, then write the character ':' (colon), and after a single space write all its possible replacements, separated by spaces. The replacements should be written in the order of their appearance in the dictionary (in the first part of the input file). If there are no replacements for this word then the line feed should immediately follow the colon.

[可能要用Trie树实现更好?]

以下暂列出STL的的解答过程：

/*
 * main.cpp
 *
 *  Created on: 2009-6-20
 *      Author: NeeSky
 */
#include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <vector>
using namespace std;
/**
 * Create A Set from Directory File
 * @param filename  the directory file name
 */
//Global Variable
map<string, int> mapDirectory;
void createMap_fromDirectoyFile(char* filename, map<string, int>& mapDirectory )
{
    ifstream ifs(filename);
    string strWord;
    int Num = 0;
    while (getline(ifs, strWord) && (strWord != "#"))
    {
        mapDirectory.insert(pair<string, int> (strWord, ++Num));
    }
    return;
}
/**
 *delete a letter or insert a letter or change a letter
 */
void insertString_toSimilarStringSet(string strGiven, unsigned int pos, set<
        string>& setStringSimilar, char tChar = '0', bool boolInsert = false )
{
    //    assert(pos<=strGiven.length());
    if (tChar == '0') //delete a letter
        strGiven.erase(pos, 1);
    else if (tChar >= 'a' && tChar <= 'z')
    {
        if (boolInsert == true)
        {
            string strChar;
            strChar = tChar;
            strGiven.insert(pos, strChar); //insert a letter
        }
        else
        {
            if (tChar == strGiven[pos])
                return; //skip itself
            else
                strGiven[pos] = tChar; //change a letter
        }
    }
    else
        return;
    if (strGiven.length() > 0) //avoid just a char word ,erase the char, then null
        setStringSimilar.insert(strGiven);
    return;
}
/**
 * Create all possiblilities similar from string given, put them to set - setStringSimiliar
 * @param strGiven
 * @param setStringSimilar
 */
void createStringSet_fromGivenString(string& strGiven, set<string>& setStringSimilar )
{
    unsigned int len = strGiven.length();
    for (unsigned int i = 0; i <= len; ++i)
    {
        if (i != len)
            insertString_toSimilarStringSet(strGiven, i, setStringSimilar); //delete a letter
        for (char tChar = 'a'; tChar <= 'z'; ++tChar)
        {
            if (i != len)
                insertString_toSimilarStringSet(strGiven,i,setStringSimilar,tChar); //change a letter
            insertString_toSimilarStringSet(strGiven,i,setStringSimilar,tChar,true); //insert a letter
        }
    }
    return;
}
/**
 * Just for ACM -POJ JUDGEMENT
 */
bool CmpPosition(string& strA, string& strB )
{
    int posStrA = mapDirectory[strA];
    int posStrB = mapDirectory[strB];
    return posStrA < posStrB;
}
/**
 * Just for ACM -POJ JUDGEMENT
 */
void ProcessSequence_toString(string& strPreResult,map<string, int>& mapDirectory )
{
    string strElement;
    istringstream istrStream(strPreResult);
    vector<string> strVector;
    while (istrStream >> strElement)
        strVector.push_back(strElement);
    vector<string>::iterator it = strVector.begin();
    strPreResult = *it;
    std::sort_heap(++it,strVector.end(),CmpPosition);
    for (; it != strVector.end(); ++it)
        strPreResult = strPreResult + " " + (*it);
    return;
}
/**
 * find result for one word question in Directory Set Given
 * @return the string result
 */
string findResult_forOneWord(string strQuestion, map<string, int> & mapDirectory )
{
    if (mapDirectory.size() == 0)
        return strQuestion + ":"; //Directory is empty
    if (mapDirectory.find(strQuestion) != mapDirectory.end())//existed
        return strQuestion + " is correct";
    set<string> setStringSimilar;
    string strResult = strQuestion + ":";
    createStringSet_fromGivenString(strQuestion, setStringSimilar);
    set<string>::iterator it = setStringSimilar.begin();
    for (; it != setStringSimilar.end(); ++it)
    {
        if (mapDirectory.find(*it) != mapDirectory.end())
        {
            strResult = strResult + " " + (*it);
            ProcessSequence_toString(strResult,mapDirectory);
        }
    }
    return strResult;
}
/**
 * Output the final result to os ostream
 * @param inputfile
 * @param directoryfile
 * @param os
 */
void getFinalResult_forInputfileByDirectoryfile(ifstream &ifs, map<string, int> & mapDirectory, ofstream &ofs )
{
    string strQuestion;
    while (getline(ifs, strQuestion)) //read a line from is
    {
        if (strQuestion.empty() == false && strQuestion != "#")
        {
            string Result = findResult_forOneWord(strQuestion, mapDirectory);
            ofs << Result << endl;
            cout << Result<<"/n"<<flush;
        }
    }
    return;
}
/**
 * Init the Sample Data Files from standard input
 * @param inputfile
 * @param directory
 */
void initFiles_InputAndDirectory(char *inputfile, char *directory )
{
    string strLine;
    ofstream ofsdire("directory.txt");
    ofstream ofsinput("input.txt");
#ifndef ONLINE_JUDGE
    ofsdire << "i/nis/nhas/nhave/nbe/nmy/nmore/ncontest/nme/ntoo/nif/naward/n#"
            << endl;
    ofsinput << "me/naware/nm/ncontest/nhav/noo/nor/ni/nfi/nmre/n#" << endl;
#else
    while (cin >> strLine)
    {
        ofsdire<<strLine<<endl;
        if (strLine == "#")
        break;
    }
    while (cin >> strLine)
    {
        ofsinput<<strLine<<endl;
        if (strLine == "#")
        break;
    }
#endif
    return;
}
/**
 * The Main Programming
 * @return
 */
int main(void )
{
    initFiles_InputAndDirectory("input.txt", "directory.txt");
    createMap_fromDirectoyFile("directory.txt", mapDirectory);
    ifstream ifs("input.txt");
    ofstream ofs("output.txt");
    getFinalResult_forInputfileByDirectoryfile(ifs, mapDirectory, ofs);
    return 0;
}

[输出]

me is correct
aware: award
m: i my me
contest is correct
hav: have has
oo: too
or:
i is correct
fi: i
mre: more me