You want to form a target string of lowercase letters.
At the beginning, your sequence is target.length ‘?’ marks. You also have a stamp of lowercase letters.
On each turn, you may place the stamp over the sequence, and replace every letter in the sequence with the corresponding letter from the stamp. You can make up to 10 * target.length turns.
For example, if the initial sequence is “?????”, and your stamp is “abc”, then you may make “abc??”, “?abc?”, “??abc” in the first turn. (Note that the stamp must be fully contained in the boundaries of the sequence in order to stamp.)
If the sequence is possible to stamp, then return an array of the index of the left-most letter being stamped at each turn. If the sequence is not possible to stamp, return an empty array.
For example, if the sequence is “ababc”, and the stamp is “abc”, then we could return the answer [0, 2], corresponding to the moves “?????” -> “abc??” -> “ababc”.
Also, if the sequence is possible to stamp, it is guaranteed it is possible to stamp within 10 * target.length moves. Any answers specifying more than this number of moves will not be accepted.
Example 1:
Input: stamp = “abc”, target = “ababc”
Output: [0,2]
([1,0,2] would also be accepted as an answer, as well as some other answers.)
Example 2:
Input: stamp = “abca”, target = “aabcaca”
Output: [3,0,1]
Note:
1 <= stamp.length <= target.length <= 1000
stamp and target only contain lowercase letters.
Solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25class Solution:
# 判断是否匹配
def check(self, s, t):
for i in range(len(s)):
if t[i] == '?': continue
if s[i] != t[i]: return False
return True
def movesToStamp(self, s, target):
turn = 0 # 匹配轮次，不超过10*len(target)
n, m = len(s), len(target)
res = []
compare = '?' * n
while turn < 10*m:
tmp = turn
for i in range(m-n+1):
if target[i:i+n] != compare and self.check(s, target[i:i+n]):
turn = turn + 1
res.append(i)
target = target[:i] + compare + target[i+n:]
# 成功还原，反向返回res
if target == '?'*m: return res[::-1]
# 如果一个匹配的都没找到，说明无法还原了，直接break
if turn == tmp: break
return []