Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Orderly Queue in C++
Suppose there is a string S. All letters in S are in lowercase. Then, we may make any number of moves.
Here, in each move, we choose one of the first K letters, and remove it, and place it at the end of the string. We have to find the lexicographically smallest string we could have after any number of moves.
So, if the input is like "cabaa" and K = 3, then the output will be "aaabc"
To solve this, we will follow these steps −
if K > 1, then −
sort the array S
return S
ret := S
n := size of S
for initialize i := 1, when i < n, update (increase i by 1), do −
S := cut the first character of S and add it at the end into S
if S < ret, then −
ret = S
return ret
Let us see the following implementation to get better understanding −
Example
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
string orderlyQueue(string S, int K) {
if(K > 1){
sort(S.begin(), S.end());
return S;
}
string ret = S;
int n = S.size();
for(int i = 1; i < n; i++){
S = S.substr(1) + S.substr(0, 1);
if(S < ret) ret = S;
}
return ret;
}
};
main(){
Solution ob;
cout << (ob.orderlyQueue("cabaa", 3));
}Input
"cabaa", 3
Output
aaabc
Updated on: 04-Jun-2020
147 Views
Advertisements