Package g0501_0600.s0541_reverse_string_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    541 - Reverse String II.

    Easy

    Given a string s and an integer k, reverse the first k characters for every 2k characters counting from the start of the string.

    If there are fewer than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and leave the other as original.

    Example 1:

    Input: s = "abcdefg", k = 2

    Output: "bacdfeg"

    Example 2:

    Input: s = "abcd", k = 2

    Output: "bacd"

    Constraints:

    • <code>1 <= s.length <= 10<sup>4</sup></code>

    • s consists of only lowercase English letters.

    • <code>1 <= k <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String reverseStr(String s, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait