Runtime: 36 ms (Top 85.00%) | Memory: 13.8 MB (Top 97.50%)

Author: AnasImloul

scripts/algorithms/O/Orderly Queue/Orderly Queue.py

@@ -1,3 +1,4 @@
+// Runtime: 36 ms (Top 85.00%) | Memory: 13.8 MB (Top 97.50%)
 class Solution:
     def orderlyQueue(self, s: str, k: int) -> str:
         if k>1:
@@ -8,4 +9,4 @@ def orderlyQueue(self, s: str, k: int) -> str:
         for i in range(len(s)):
             s=s[1:]+s[0]
             s1=min(s1,s)
-        return s1
+        return s1