- 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
Rotate List Left by K in C++
Suppose we have a list of numbers. We have to define a method that can rotate a list of numbers to the left by k elements.
So, if the input is like [5,4,7,8,5,6,8,7,9,2], k = 2, then the output will be [8,5,6,8,7,9,2,5,4,7]
To solve this, we will follow these steps −
Define an array ret
n := size of nums
k := k mod n
for initialize i := k, when i < n, update (increase i by 1), do −
insert nums[i] at the end of ret
for initialize i := 0, when i < k, update (increase i by 1), do −
insert nums[i] at the end of ret
return ret
Let us see the following implementation to get better understanding −
Example
#include <bits/stdc++.h> using namespace std; void print_vector(vector<auto> v) { cout << "["; for (int i = 0; i < v.size(); i++) { cout << v[i] << ", "; } cout << "]" << endl; } class Solution { public: vector<int> solve(vector<int>& nums, int k) { vector <int> ret; int n = nums.size(); k %= n; for(int i = k; i < n; i++){ ret.push_back(nums[i]); } for(int i = 0; i < k; i++){ ret.push_back(nums[i]); } return ret; } }; main(){ Solution ob; vector<int> v = {5,4,7,8,5,6,8,7,9,2}; print_vector(ob.solve(v, 3)); }
Input
{5,4,7,8,5,6,8,7,9,2}, 2
Output
[8, 5, 6, 8, 7, 9, 2, 5, 4, 7, ]
Advertisements
To Continue Learning Please Login
Login with Google