The constructor should accept two parameters:
queryMultiple which accepts an array of string keys input. It will resolve with an array of values that is the same length as the input array. Each index corresponds to the value associated with input[i]. You can assume the promise will never reject.queryMultiple which accepts an array of string keys input. It will resolve with an array of values that is the same length as the input array. Each index corresponds to the value associated with input[i]. You can assume the promise will never reject.t.Each character of the English alphabet has been mapped to a digit as shown below.
+每个英文字母都被映射到一个数字，如下所示。
A string is divisible if the sum of the mapped values of its characters is divisible by its length.
+如果字符串的字符的映射值的总和可以被字符串的长度整除，则该字符串是 可整除 的。
-Given a string s, return the number of divisible substrings of s.
给定一个字符串 s，请返回 s 的 可整除子串 的数量。
A substring is a contiguous non-empty sequence of characters within a string.
+子串 是字符串内的一个连续的非空字符序列。
-
Example 1:
+ +示例 1：
-Input: word = "asdf" -Output: 6 -Explanation: The table above contains the details about every substring of word, and we can see that 6 of them are divisible. +输入：word = "asdf" +输出：6 +解释：上表包含了有关 word 中每个子串的详细信息，我们可以看到其中有 6 个是可整除的。-
Example 2:
+示例 2:
-Input: word = "bdh" -Output: 4 -Explanation: The 4 divisible substrings are: "b", "d", "h", "bdh". -It can be shown that there are no other substrings of word that are divisible. +输入：word = "bdh" +输出：4 +解释：4 个可整除的子串是："b"，"d"，"h"，"bdh"。 +可以证明 word 中没有其他可整除的子串。-
Example 3:
+示例 3:
-Input: word = "abcd" -Output: 6 -Explanation: The 6 divisible substrings are: "a", "b", "c", "d", "ab", "cd". -It can be shown that there are no other substrings of word that are divisible. +输入：word = "abcd" +输出：6 +解释：6 个可整除的子串是："a"，"b"，"c"，"d"，"ab"，"cd"。 +可以证明 word 中没有其他可整除的子串。
-
Constraints:
+ +提示：
1 <= word.length <= 2000word consists only of lowercase English letters.word 仅包含小写英文字母。