Class Solution
java.lang.Object
g0501_0600.s0541_reverse_string_ii.Solution
541 - Reverse String II.<p>Easy</p>
<p>Given a string <code>s</code> and an integer <code>k</code>, reverse the first <code>k</code> characters for every <code>2k</code> characters counting from the start of the string.</p>
<p>If there are fewer than <code>k</code> characters left, reverse all of them. If there are less than <code>2k</code> but greater than or equal to <code>k</code> characters, then reverse the first <code>k</code> characters and left the other as original.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “abcdefg”, k = 2</p>
<p><strong>Output:</strong> “bacdfeg”</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “abcd”, k = 2</p>
<p><strong>Output:</strong> “bacd”</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
<li><code>s</code> consists of only lowercase English letters.</li>
<li><code>1 <= k <= 10<sup>4</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
reverseStr
-