Two Substrings

Description

You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).

Input

The only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters.

Output

Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.

Sample Input

Input
ABA
Output
NO
Input
BACFAB
Output
YES
Input
AXBYBXA
Output
NO

Hint

In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO".

In the second sample test there are the following occurrences of the substrings: BACFAB.

In the third sample test there is no substring "AB" nor substring "BA".

题目解析:给出一串字符 ,在其中寻找"AB"和”BA“如果包含这两个则输出YES否则NO。

题目链接:http://codeforces.com/problemset/problem/550/A

源代码:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    char a[100000],b[100000];
    int i,len;
    bool f1=0,f2=0;
    scanf("%s",a);
    memcpy(b,a,sizeof(a));
    len=strlen(a);
    for(i=0;i<len;i++)
    {
        if(a[i]=='A'&&a[i+1]=='B')
        {
            f1=1;
            a[i]='1';
            a[i+1]='1';
            break;
        }
    }
    for(i=0;i<len;i++)
    {
        if(a[i]=='B'&&a[i+1]=='A')
        {
            f2=1;
            break;
        }
    }
    if(f1&&f2)
    {
       printf("YES\n");
       return 0;
    }
    f1=false;
    f2=false;
    for(i=0;i<len;i++)
    {
        if(b[i]=='B'&&b[i+1]=='A')
        {
            f2=1;
            b[i]='1';
            b[i+1]='1';
            break;
        }
    }
    for(i=0;i<len;i++)
    {
        if(b[i]=='A'&&b[i+1]=='B')
        {
            f1=1;
            break;
        }
    }
    if(f1&&f2)
    {
        printf("YES\n");
        return 0;
    }
    printf("NO\n");
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值