Given two strings
t, your goal is to convert
k moves or less.
1 <= i <= k) move you can:
s, such that
1 <= j <= s.lengthand
jhas not been chosen in any previous move, and shift the character at that index
Shifting a character means replacing it by the next letter in the alphabet (wrapping around so that
'a'). Shifting a character by
i means applying the shift operations
Remember that any index
j can be picked at most once.
true if it's possible to convert
t in no more than
k moves, otherwise return
Input: s = "input", t = "ouput", k = 9 Output: true Explanation: In the 6th move, we shift 'i' 6 times to get 'o'. And in the 7th move we shift 'n' to get 'u'.
Input: s = "abc", t = "bcd", k = 10 Output: false Explanation: We need to shift each character in s one time to convert it into t. We can shift 'a' to 'b' during the 1st move. However, there is no way to shift the other characters in the remaining moves to obtain t from s.
Input: s = "aab", t = "bbb", k = 27 Output: true Explanation: In the 1st move, we shift the first 'a' 1 time to get 'b'. In the 27th move, we shift the second 'a' 27 times to get 'b'.
1 <= s.length, t.length <= 10^5
0 <= k <= 10^9
tcontain only lowercase English letters.