A. The Alphabet Sticker 思维

When we were kids, we used to play with some stickers where these stickers contain some (but not necessarily all) lower case English alphabet letters.
Each sticker contains some letters arranged in a single row, where all occurrences of the same letter are adjacent to each other. A sticker can be represented as a string of characters, for example the following are valid stickers’ representations: “aabcc”, “ccccab” and “mmaw”. And the following are not valid (because not all occurrences of the same letter are adjacent to each other): “abacc”, “cccabc” and “mawm”.
Now we found some stickers with some missing letters, but we are sure that all missing letters belong to the visible letters set (that is, for every missing letter, there is at least one visible letter that matches the missing one). In this problem a question mark letter represents a missing letter. Given some stickers’ representations with zero or more missing letters, your task is to count the number of possible original configurations for each sticker.
For example, this sticker “aa??bb” with missing letters could have been one of the following original stickers“aaaabb”, “aaabbb” or “aabbbb”. But it could not have been any of the following original stickers “aababb”(it is invalid sticker) and “aaccbb” (because the letter ‘c’ did not appear in the given configuration).
Input
Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 ≤ T ≤ 100). Followed by the test cases, each test case is described in one line which contains a non-empty string which consists of up to 10,000 letters, each letter is either a lowercase English letter (from ‘a’ to ‘z’) or a question mark (‘?’). This string represents a sticker configuration which contains zero or more question marks, it will also contain at least one letter which is not a question mark and there will be at least one valid original configuration for it.
Output
For each test case, print a single line which contains a single integer representing the number of possible original configurations for the sticker, since the result may be very large, print it modulo 1,000,000,007(10^9 + 7).

4
aa??bb
aaccbb
?a?
a??a

3
1
1
1

题目：判断合法的种类数，如果相同字母在一块，则合法
思路：
当问号在两边或者没有的时候自然是一种；
当问号在中间：
1.如果两边相同，一种
2.如果不同：
假设是a和b，如果有两个问号 aa bb ab,如果有三个问号 aaa aab abb bbb，如果有四个问号，
aaaa aaab aabb abbb bbbb。由此可见其规律，种类=长度+1；
当问号分为几部分，则相乘；
代码：

#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<string.h>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int t,n; 
int main()
{
	cin>>t;
	while(t--)
	{
		string s;
		cin>>s;
		ll ans=1;
		int a=0,b=s.size()-1;
		while(s[a]=='?')a++;
		while(s[b]=='?')b--;
		for(int i=a;i<=b;i++)
		{
			if(s[i]=='?')
			{
				int t=i;
				while(s[t]=='?')
				{
					t++;
				}
				if(s[i-1]!=s[t])ans=(ans*((t-i+1)%mod))%mod;
				i=t;
			}
		}
		cout<<ans<<'\n';
	}
    return 0; 
}