Fixing Typos CodeForces - 363C

大致题意:个人感觉题目描述的不是很清楚,一开始理解错了。大致意思分为两种情况:1> 不能出现三个或者三个以上连续相同的字母   2>不能出现两个不同字母连续如aabb是不符合题意的。让你删除最少的字母得到符合题意的数组,可能有多组数据符合题意输出任意一组就行!!!

解题思路:开两个数组,边比较边存!!!看代码一目了然


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

In this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, 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 from both 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 and is obtained from s by deleting the least number of letters.

If there are multiple solutions, print any of them.

Example
Input
helloo
Output
hello
Input
woooooow
Output
woow
Note

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


#include<stdio.h>
#include<string.h>
char s[200010],str[200010];
int main()
{
    scanf("%s",str);
    int t=0,i,j;
    //只能赋给前两个值,因为超过两个可能出现三个相同的无法判断
    s[t++]=str[0];
    s[t++]=str[1];
    for(i=2;i<strlen(str);i++)
    {
        char ch=str[i];
        //三个或以上连续相同的字母或者两个不同字母连续出现两次如aabb
        if((ch==s[t-1]&&s[t-2]==s[t-3])||(ch==s[t-1]&&s[t-1]==s[t-2]))
            continue;
        else
            s[t++]=ch;
    }
    s[t]='\0';
    printf("%s\n",s);
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值