Package g1501_1600.s1528_shuffle_string

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1528 - Shuffle String.

    Easy

    You are given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the <code>i<sup>th</sup></code> position moves to indices[i] in the shuffled string.

    Return the shuffled string.

    Example 1:

    Input: s = "codeleet", indices = 4,5,6,7,0,2,1,3

    Output: "leetcode"

    Explanation: As shown, "codeleet" becomes "leetcode" after shuffling.

    Example 2:

    Input: s = "abc", indices = 0,1,2

    Output: "abc"

    Explanation: After shuffling, each character remains in its position.

    Constraints:

    • s.length == indices.length == n

    • 1 &lt;= n &lt;= 100

    • s consists of only lowercase English letters.

    • 0 &lt;= indices[i] &lt; n

    • All values of indices are unique.

    • 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 restoreString(String s, IntArray indices)

      • Methods inherited from class java.lang.Object

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