LeetCode 848. Shifting Letters

848. Shifting Letters

We have a string S of lowercase letters, and an integer array shifts.

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’, and shift(‘z’) = ‘a’.

Now for each shifts[i] = x, we want to 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”
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.
Note:

1 <= S.length = shifts.length <= 20000
0 <= shifts[i] <= 10 ^ 9

Approach

题目大意：给定一组反转数，要求你将字母向前翻转（字母范围a~z）（z反转为a）
思路方法：这题用前缀和处理，一次性求出每个字母需要翻转的次数，否则会超时，当然要防止数据溢出，所以要将过程取余。

Code

class Solution {
public:
    string shiftingLetters(string S, vector<int>& shifts) {
        if (shifts.size() == 0 || S == "")return S;
        for (int i = shifts.size() - 2; i >= 0; i--) {
            shifts[i] = (shifts[i]%26+shifts[i + 1]%26)%26;
        }
        for (int i = 0; i < shifts.size(); i++) {
            int c = S[i] - 'a' + shifts[i];
            S[i] = 'a' + c % 26;
        }
        return S;
    }
};