A-B Palindrome

A-B Palindrome Codeforces-1512C

2021.05.01 训练题B
题目大意：给定一个长度为 a+b 的字符串，字符串中的字符用 ’ 0 ‘，’ 1 ‘，’ ? '三种组成，给定字符串中 ’ 0 ’ 和 ’ 1 ’ 的数量 a 和 b ，需要将字符串中的 ’ ? ’ 替换成 ’ 0 ’ 或 ’ 1 ’ ，问是否能该串转化成回文串
做法：两次双指针遍历，第一次将对称位置更改成一致的，第二次将 ? 换成其他字符
题目

You are given a string s consisting of the characters '0', '1', and '?'. You need to replace all the characters with '?' in the string s by '0' or '1' so that the string becomes a palindrome and has exactly a characters '0' and exactly b characters '1'. Note that each of the characters '?' is replaced independently from the others.

A string t of length n is called a palindrome if the equality t[i]=t[n−i+1] is true for all i (1≤i≤n).

For example, if s="01?????0", a=4 and b=4, then you can replace the characters '?' in the following ways:

"01011010";
"01100110".
For the given string s and the numbers a and b, replace all the characters with '?' in the string s by '0' or '1' so that the string becomes a palindrome and has exactly a characters '0' and exactly b characters '1'.

Input
The first line contains a single integer t (1≤t≤104). Then t test cases follow.

The first line of each test case contains two integers a and b (0≤a,b≤2⋅105, a+b≥1).

The second line of each test case contains the string s of length a+b, consisting of the characters '0', '1', and '?'.

It is guaranteed that the sum of the string lengths of s over all test cases does not exceed 2⋅105.

Output
For each test case, output:

"-1", if you can't replace all the characters '?' in the string s by '0' or '1' so that the string becomes a palindrome and that it contains exactly a characters '0' and exactly b characters '1';
the string that is obtained as a result of the replacement, otherwise.
If there are several suitable ways to replace characters, you can output any.

Example
Input
9
4 4
01?????0
3 3
??????
1 0
?
2 2
0101
2 2
01?0
0 1
0
0 3
1?1
2 2
?00?
4 3
??010?0
Output
01011010
-1
0
-1
0110
-1
111
1001
0101010

代码实现

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Palindrome {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-- != 0) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			sc.nextLine();
			String ss = sc.nextLine();
			StringBuilder sb = new StringBuilder(ss);
			int left = 0;
			int right = sb.length()-1;
			int[] arr = new int[] {a,b};//记录字符'0'和字符'1'的个数
			char c1,c2;
			while(left <= right) {
				c1 = sb.charAt(left);
				c2 = sb.charAt(right);
				if(c1!='?') arr[c1-'0']--;
				if(c2!='?' && left!=right) arr[c2-'0']--;
				if(c1 != c2) {
					if(c1=='?') {
						sb.setCharAt(left, c2);
						arr[c2-'0']--;
					}else if(c2 == '?') {
						sb.setCharAt(right, c1);
						arr[c1-'0']--;
					}else {
						break;
					}
				}
				left++;
				right--;
			}
			if(!sb.toString().equals(sb.reverse().toString())) {
				System.out.println(-1);
			}else {
				left = 0;
				right = sb.length()-1;
				while(left <= right) {
					if(sb.charAt(left)=='?') {
						if(left == right) {
							if(arr[0]%2==0) {
								sb.setCharAt(left, '1');
								arr[1]--;
							}
							else {
								sb.setCharAt(left, '0');
								arr[0]--;
							}
						}else {
							if(arr[0] >= 2) {
								sb.setCharAt(left, '0');
								sb.setCharAt(right, '0');
								arr[0]-=2;
							}else if(arr[1] >= 2){
								sb.setCharAt(left, '1');
								sb.setCharAt(right, '1');
								arr[1]-=2;
							}
						}
					}
					left++;
					right--;
				}
				if(arr[0]==0&&arr[1]==0&&sb.toString().equals(sb.reverse().toString())) System.out.println(sb);
				else System.out.println(-1);
			}
		}
	}
}