Class Solution
-
- All Implemented Interfaces:
public final class Solution1639 - Number of Ways to Form a Target String Given a Dictionary.
Hard
You are given a list of strings of the same length
wordsand a stringtarget.Your task is to form
targetusing the givenwordsunder the following rules:targetshould be formed from left to right.To form the <code>i<sup>th</sup></code> character ( 0-indexed ) of
target, you can choose the <code>k<sup>th</sup></code> character of the <code>j<sup>th</sup></code> string inwordsiftarget[i] = words[j][k].Once you use the <code>k<sup>th</sup></code> character of the <code>j<sup>th</sup></code> string of
words, you can no longer use the <code>x<sup>th</sup></code> character of any string inwordswherex <= k. In other words, all characters to the left of or at indexkbecome unusuable for every string.Repeat the process until you form the string
target.
Notice that you can use multiple characters from the same string in
wordsprovided the conditions above are met.Return the number of ways to form
targetfromwords. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.Example 1:
Input: words = "acca","bbbb","caca", target = "aba"
Output: 6
Explanation: There are 6 ways to form target.
"aba" -> index 0 ("acca"), index 1 ("bbbb"), index 3 ("caca")
"aba" -> index 0 ("acca"), index 2 ("bbbb"), index 3 ("caca")
"aba" -> index 0 ("acca"), index 1 ("bbbb"), index 3 ("acca")
"aba" -> index 0 ("acca"), index 2 ("bbbb"), index 3 ("acca")
"aba" -> index 1 ("caca"), index 2 ("bbbb"), index 3 ("acca")
"aba" -> index 1 ("caca"), index 2 ("bbbb"), index 3 ("caca")
Example 2:
Input: words = "abba","baab", target = "bab"
Output: 4
Explanation: There are 4 ways to form target.
"bab" -> index 0 ("baab"), index 1 ("baab"), index 2 ("abba")
"bab" -> index 0 ("baab"), index 1 ("baab"), index 3 ("baab")
"bab" -> index 0 ("baab"), index 2 ("baab"), index 3 ("baab")
"bab" -> index 1 ("abba"), index 2 ("baab"), index 3 ("baab")
Constraints:
1 <= words.length <= 10001 <= words[i].length <= 1000All strings in
wordshave the same length.1 <= target.length <= 1000words[i]andtargetcontain only lowercase English letters.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-