poj 1035

这题虽然是个模拟，但是很容易超时，几种情况合并之后可以简化问题。
考虑到删除，增加，替换一个字符的情况，可以灵活使用指针i，用两个for循环遍历串，最后检查指针i的位置即可

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
#include <set>

#define debug puts("-----")
#define pi (acos(-1.0))
#define eps (1e-8)
#define inf 1<<28
using namespace std;


bool delete_insert_replace(string str, string dir) {
	int difflen = str.length() - dir.length();
	int i;
	if (difflen > 0) {
		swap(str, dir);
		difflen = -difflen;
	}
	if (difflen == 0) {
		for (i = 0; i < str.length() && str[i] == dir[i]; i++);
		for (i++; i < str.length() && str[i] == dir[i]; i++);
		if (i == str.length()) {
			return true;
		}
	} else if (difflen == -1) {
		//str.len<dir.len
		for (i = 0; i < str.length() && str[i] == dir[i]; i++);
		for (; i < str.length() && str[i] == dir[i + 1]; i++);
		if (i == str.length()) {
			return true;
		}
	}
	return false;
}
int main() {
	string word;
	set<string> myset;
	vector<string> myvec;
	while (cin >> word&&word != "#") {
		myset.insert(word);
		myvec.push_back(word);
	}
	int test = 0;
	while (cin >> word&&word != "#") {
		if (myset.find(word)== myset.end()) {
			cout << word << ": ";
			for (vector<string>::iterator it = myvec.begin(); it != myvec.end(); it++) {
				if (delete_insert_replace(word, *it) == true) {
					cout << *it << " ";
				}
			}
			cout << endl;
		} else {
			cout << word << " is correct" << endl;
		}
	}
	//system("pause");
	return 0;
}