用给定个数的0,1，替换字符串中的 ‘?‘ 并使之成为回文串，不能的输出-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
思维题：用给定个数的0,1，替换字符串中的 ‘?’ 并使之成为回文串，不能的输出-1，一步步模拟怎么走即可。代码：

#include <stdio.h>
#include <string.h>
int main()
{
	int k,i,j,t,a,b,n,m;
	char s[411010];
	scanf("%d",&t);
	while(t--)
	{
		int flag=0;
		scanf("%d %d",&a,&b);
		getchar();
		gets(s);
		k=a+b;
		for(i=0;i<k;i++)//先遍历一遍找出已经存在的0，1
		{
			if(s[i]=='0')
				a--;
			if(s[i]=='1')
				b--;
		}
		for(i=0;i<k;i++)//先让存在的0，1，配对，就是找到对应位置（k-i-1）使之变为0，或1
		{
			if(s[i]=='0'&&s[k-i-1]=='?')
			{
				s[k-1-i]='0';
				a--;
			}
			if(s[i]=='1'&&s[k-i-1]=='?')
			{
				s[k-1-i]='1';
				b--;
			}
		}
		
		for(i=0;i<k;i++)
		{
			if(s[i]!=s[k-1-i])//经过上述操作字符串应该是匹配的但例如0101这种就不能判断，需要再判断是否是回文串如果不是就标记一下直接退出循环输出-1
			{
				flag=1;
				break;
			}
			if(i==k-i-1&&s[i]=='?')//如果字符串中字符个数为奇数且中位数是'?'那么填0，1，都可以这个步骤应该是最后一步操作（循环结束条件为i<=k/2也可以），因为字符串是两边一起判断的
			{
				if(a>=1)
				{
					a--;
					s[i]='0';
				}
				else if(b>=1)
				{
					b--;
					s[i]='1';
				}
			}
			if(s[i]=='?'&&s[k-i-1]=='?')//如果此位置和对应位置都是'?'那么0，1都可以且两边要一起填
			{
				if(a>=2)
				{
					a-=2;
					s[i]=s[k-i-1]='0';
				}
				else if(b>=2)
				{
					b-=2;
					s[i]=s[k-i-1]='1';
				}
			}
			
		}
		//判断不成立的条件输出-1
		if(flag==1||a!=0||b!=0)
		{
			printf("-1\n");
			continue;
		}
		else
		puts(s);
		
	}
	return 0;
}