Left Rotation (hackerrank)
123456789101112131415161718192021222324252627
#include <iostream>
#include <vector>
using namespace std;
vector<int> rotate(int x, vector <int> y){
vector <int> ret = y;
for(int i = 0; i < x; i++){
int d = ret[0];
ret.erase(ret.begin());
ret.push_back(d);
}
return ret;
}
int main() {
vector <int> replace = {2, 5, 6, 85, 145, 985, 541, 159, 157, 626};
replace = rotate(5, replace);
for(int i = 0 ; i < replace.size(); i++){
cout << replace[i] << endl;
}
return 0;
}
Cpp
INFO