Class Solution
-
- All Implemented Interfaces:
public final class Solution
848 - Shifting Letters\.
Medium
You are given a string
s
of lowercase English letters and an integer arrayshifts
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
, we want to shift the firsti + 1
letters ofs
,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"
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.
Example 2:
Input: s = "aaa", shifts = 1,2,3
Output: "gfd"
Constraints:
<code>1 <= s.length <= 10<sup>5</sup></code>
s
consists of lowercase English letters.shifts.length == s.length
<code>0 <= shiftsi<= 10<sup>9</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final String
shiftingLetters(String s, IntArray shifts)
-
-
Method Detail
-
shiftingLetters
final String shiftingLetters(String s, IntArray shifts)
-
-
-
-