Package g0801_0900.s0899_orderly_queue

Class Solution

java.lang.Object
g0801_0900.s0899_orderly_queue.Solution
public class Solution extends java.lang.Object
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 1st character ‘c’ to the end, obtaining the string “bac”.

In the second move, we move the 1st 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 1st character ‘b’ to the end, obtaining the string “aacab”.

In the second move, we move the 3rd character ‘c’ to the end, obtaining the final result “aaabc”.

Constraints:

  • 1 <= k <= s.length <= 1000
  • s consist of lowercase English letters.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    java.lang.String
    orderlyQueue(java.lang.String s, int k)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • orderlyQueue

      public java.lang.String orderlyQueue(java.lang.String s, int k)