mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
41 lines
1.6 KiB
HTML
41 lines
1.6 KiB
HTML
<p>You are given a string <code>s</code> of lowercase English letters and an integer array <code>shifts</code> of the same length.</p>
|
|
|
|
<p>Call the <code>shift()</code> of a letter, the next letter in the alphabet, (wrapping around so that <code>'z'</code> becomes <code>'a'</code>).</p>
|
|
|
|
<ul>
|
|
<li>For example, <code>shift('a') = 'b'</code>, <code>shift('t') = 'u'</code>, and <code>shift('z') = 'a'</code>.</li>
|
|
</ul>
|
|
|
|
<p>Now for each <code>shifts[i] = x</code>, we want to shift the first <code>i + 1</code> letters of <code>s</code>, <code>x</code> times.</p>
|
|
|
|
<p>Return <em>the final string after all such shifts to s are applied</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "abc", shifts = [3,5,9]
|
|
<strong>Output:</strong> "rpl"
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "aaa", shifts = [1,2,3]
|
|
<strong>Output:</strong> "gfd"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consists of lowercase English letters.</li>
|
|
<li><code>shifts.length == s.length</code></li>
|
|
<li><code>0 <= shifts[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|