Shifting Letters
You are given a string s of lowercase English letters and an integer array shifts of the same length.
Call the shift() of a letter the next letter in the alphabet, wrapping around so that 'z' becomes 'a'.
- For example,
shift('a') = 'b',shift('t') = 'u', andshift('z') = 'a'.
Now for each shifts[i] = x, shift the first i + 1 letters of s, x times.
Return the final string after all such shifts to s are applied.
Example 1
Input
s = "abc", shifts = [3,5,9]Output
"rpl"Starting from "abc", the shifts produce "dbc", then "igc", then "rpl".
Example 2
Input
s = "aaa", shifts = [1,2,3]Output
"gfd"Applying the cumulative shifts to "aaa" results in "gfd".
Constraints
- 1 <= s.length <= 10^5
- s consists of lowercase English letters.
- shifts.length == s.length
- 0 <= shifts[i] <= 10^9