We have a string
s of lowercase letters, and an integer array
Call the shift of a letter, the next letter in the alphabet, (wrapping around so that
shift('a') = 'b',
shift('t') = 'u', and
shift('z') = 'a'.
Now for each
shifts[i] = x, we want to shift the first
i+1 letters of
Return the final string after all such shifts to
s are applied.
Input: s = "abc", shifts = [3,5,9] Output: "rpl" Explanation: We start with "abc". After shifting the first 1 letters of S by 3, we have "dbc". After shifting the first 2 letters of S by 5, we have "igc". After shifting the first 3 letters of S by 9, we have "rpl", the answer.
1 <= s.length = shifts.length <= 20000
0 <= shifts[i] <= 109