mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>Return <em>the final string after all such shifts to </em><code>s</code><em> are applied</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "abc", shifts = [[0,1,0],[1,2,1],[0,2,1]]
|
||||
@@ -14,7 +14,7 @@
|
||||
Secondly, shift the characters from index 1 to index 2 forward. Now s = "zbd".
|
||||
Finally, shift the characters from index 0 to index 2 forward. Now s = "ace".</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "dztz", shifts = [[0,0,0],[1,1,1]]
|
||||
|
Reference in New Issue
Block a user