Package g0801_0900.s0899_orderly_queue

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    899 - Orderly Queue.

    Hard

    You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..

    Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.

    Example 1:

    Input: s = "cba", k = 1

    Output: "acb"

    Explanation:

    In the first move, we move the 1<sup>st</sup> character 'c' to the end, obtaining the string "bac".

    In the second move, we move the 1<sup>st</sup> character 'b' to the end, obtaining the final result "acb".

    Example 2:

    Input: s = "baaca", k = 3

    Output: "aaabc"

    Explanation:

    In the first move, we move the 1<sup>st</sup> character 'b' to the end, obtaining the string "aacab".

    In the second move, we move the 3<sup>rd</sup> character 'c' to the end, obtaining the final result "aaabc".

    Constraints:

    • 1 &lt;= k &lt;= s.length &lt;= 1000

    • s consist of lowercase English letters.

    • 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 orderlyQueue(String s, Integer k)

      • Methods inherited from class java.lang.Object

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