g0801_0900.s0848_shifting_letters.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0801_0900.s0848_shifting_letters;
// #Medium #Array #String #2022_03_24_Time_11_ms_(88.11%)_Space_55.9_MB_(79.10%)
public class Solution {
public String shiftingLetters(String s, int[] shifts) {
int n = shifts.length;
int runningSum = 0;
for (int i = n - 1; i >= 0; i--) {
shifts[i] = (shifts[i] + runningSum) % 26;
runningSum = shifts[i];
}
StringBuilder str = new StringBuilder();
int i = 0;
for (char c : s.toCharArray()) {
int correctShift = (c - 'a' + shifts[i]) % 26;
str.append((char) ('a' + correctShift));
i++;
}
return str.toString();
}
}