ABC String

ABC String Codeforces-1494A

2021.05.02 训练题B
**题目大意：**给定一个字符串，该字符串由 ’ A ‘，’ B '，‘ C '三种字符组成，将这些字符替换成 ’ ( ’ 或者 ’ ) ’ 是否能得到标准的串（即 左右括号互相照应，有整数对括号组）
**思路：**将第一个字符代表的字母替换成 ’ ( ’ ，将最后一个字符代表的字母替换成 ’ ) '，若第一个字符等于最后一个字符，一定不满足题意，若不相等，则将剩下的一个字母分别替换成 ’ ( ’ 和 ’ ) ’ 分别验证是否满足题意即可
题目：

You are given a string a, consisting of n characters, n is even. For each i from 1 to n ai is one of 'A', 'B' or 'C'.

A bracket sequence is a string containing only characters "(" and ")". A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()()" and "(())" are regular (the resulting expressions are: "(1)+(1)" and "((1+1)+1)"), and ")(", "(" and ")" are not.

You want to find a string b that consists of n characters such that:

b is a regular bracket sequence;
if for some i and j (1≤i,j≤n) ai=aj, then bi=bj.
In other words, you want to replace all occurrences of 'A' with the same type of bracket, then all occurrences of 'B' with the same type of bracket and all occurrences of 'C' with the same type of bracket.

Your task is to determine if such a string b exists.

Input
The first line contains a single integer t (1≤t≤1000) — the number of testcases.

Then the descriptions of t testcases follow.

The only line of each testcase contains a string a. a consists only of uppercase letters 'A', 'B' and 'C'. Let n be the length of a. It is guaranteed that n is even and 2≤n≤50.

Output
For each testcase print "YES" if there exists such a string b that:

b is a regular bracket sequence;
if for some i and j (1≤i,j≤n) ai=aj, then bi=bj.
Otherwise, print "NO".

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

Example
Input
4
AABBAC
CACA
BBBBAC
ABCA
Output
YES
YES
NO
NO
Note
In the first testcase one of the possible strings b is "(())()".

In the second testcase one of the possible strings b is "()()".

代码实现：

import java.util.Scanner;
import java.util.Stack;

public class ABC_String {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		sc.nextLine();
		while(t--!=0) {
			String ss = sc.nextLine();
			char c1 = ss.charAt(0);
			char c2 = ss.charAt(ss.length()-1);
			if(c1==c2) {
				System.out.println("NO");
				continue;
			}
			char c3 = getChar(c1,c2);
			ss = ss.replace(c1, '(');
			ss = ss.replace(c2, ')');
			String str = ss;
			str = ss.replace(c3, '(');
			ss = ss.replace(c3, ')');
			System.out.println((getAns(ss)||getAns(str))?"YES":"NO");
		}
	}

	private static boolean getAns(String ss) {
		Stack<Character> stack = new Stack<>();
		for(int i=0;i<ss.length();i++) {
			if(ss.charAt(i)=='(') stack.push('(');
			else {
				if(stack.isEmpty()) return false;
				stack.pop();
			}
		}
		if(stack.isEmpty()) return true;
		else return false;
	}

	private static char getChar(char c1, char c2) {
		if(c1!='C'&&c2!='C') return 'C';
		else if(c1!='B'&&c2!='B') return 'B';
		else return 'A';
	}
}