-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_24.cpp
57 lines (39 loc) · 1.1 KB
/
question_24.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*
==> Rotating an Array <==
Question Link:- https://practice.geeksforgeeks.org/problems/reversal-algorithm5340/1?page=2&difficulty[]=-1&category[]=Arrays&sortBy=submissions
Given an array of size N. The task is to rotate array by D elements where D ≤ N.
Example 1:
Input:
N = 7
Arr[] = {1, 2, 3, 4, 5, 6, 7}
D = 2
Output: 3 4 5 6 7 1 2
Explanation:
Rotate by 1: [2, 3, 4, 5, 6, 7, 1]
Rotate by 2: [3, 4, 5, 6, 7, 1, 2]
Example 2:
Input:
N = 4
Arr[] = {1, 3, 4, 2}
D = 3
Output: 2 1 3 4
*/
#include <iostream>
#include <vector>
using namespace std;
void printArray(int arr [], int n) {
for ( int i = 0; i < n; i++ ) cout << arr[i] << "";
cout << endl;
}
void leftRotate(int arr[], int n, int d) {
vector<int> tempar;
for ( int i = d; i < n; i++ ) tempar.push_back(arr[i]);
for ( int i = 0; i < d; i++ ) tempar.push_back(arr[i]);
for ( int i = 0; i < n; i++ ) arr[i] = tempar[i];
}
int main () {
int arr[] = {1, 2, 3, 4, 5, 6, 7};
leftRotate(arr, 7, 2);
printArray(arr, 7);
return 0;
}