1
class Solution {
2
public String shiftingLetters(String s, int[] shifts) {
3
char[] arr = s.toCharArray();
4
int[] arr1 = new int[shifts.length];
5
arr1[arr1.length - 1] = (shifts[shifts.length - 1]) % 26;
6
for (int i = shifts.length - 2; i >= 0; i--) {
7
arr1[i] = (shifts[i] + arr1[i + 1]) % 26;
8
}
9
for (int i = 0; i < arr.length; i++) {
10
int c = (int) (arr[i]);
11
int n = c + arr1[i];
12
if (n > 122) {
13
int m = arr1[i] - (122 - c);
14
n = m + 96;
15
}
16
char ch = (char) n;
17
arr[i] = ch;
18
}
19
String string = new String(arr);
20
return string;
21
}
22
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0