CodeForces 363C - Fixing Typos

最新推荐文章于 2017-10-27 20:48:31 发布

原创最新推荐文章于 2017-10-27 20:48:31 发布 · 756 阅读

0 ·

CC 4.0 BY-SA版权

CodeForces 同时被 2 个专栏收录

16 篇文章

订阅专栏

模拟

9 篇文章

订阅专栏

本文探讨了现代文本编辑器如何自动检查拼写错误，并提供纠正建议。具体介绍了通过删除字母来修正文本中常见的两种错误类型：三个相同字母连续出现和两对字母紧随其后的情况。详细阐述了解决问题的算法流程，包括读取输入字符串，遍历并判断字母重复情况，以及输出修正后的字符串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Many modern text editors automatically check the spelling of the user'stext. Some editors even suggest how to correct typos.

In this problem your task to implement a small functionality to correcttwo types of typos in a word. We will assume that three identical letterstogether is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical lettersimmediately followed by another couple of identical letters is a typo too (forexample, words "helloo" and "wwaatt" contain typos).

Write a code that deletes the minimum number of letters from a word,correcting described typos in the word. You are allowed to delete letters fromboth ends and from the middle of the word.

Input

The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.

Output

Print such word t that it doesn't contain any typos described in the problem statement andis obtained from s by deleting the least number of letters.

If there are multiple solutions, print any of them.

Sample test(s)

input

helloo

output

hello

input

woooooow

output

woow

Note

The second valid answer to the test from the statement is "heloo".

思路：

有两种输入错误：

1、同一个字符连续出现3次

2、两对字符相连

代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
	int len;
	char temp[200005];
	while (scanf("%s", temp) != EOF)
	{
		char c;
		string st;
		int l = strlen(temp);
		int i;
		bool flag = false;
		st = temp[0];
		for (i = 1; i<l; i++)
		{
			c = temp[i];

			len = st.length();

			if (c == st[len - 1])
			{
				if (!flag)
				{
					st += c;
					flag = true;
				}
			}
			else
				st += c;

			len = st.length();
			if (len>3 && st[len - 1] != st[len - 2] && st[len - 2] != st[len - 3])
				flag = false;
		}
		cout << st << endl;
	}

	return 0;
}