-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeftRotateTheArray.cpp
More file actions
73 lines (52 loc) · 2.02 KB
/
LeftRotateTheArray.cpp
File metadata and controls
73 lines (52 loc) · 2.02 KB
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
A left rotation operation on an array of size shifts each of the array's elements unit to the left. For example, if left rotations are performed on array , then the array would become .
Given an array of integers and a number, , perform left rotations on the array. Then print the updated array as a single line of space-separated integers.
Input Format
The first line contains two space-separated integers denoting the respective values of (the number of integers) and (the number of left rotations you must perform).
The second line contains space-separated integers describing the respective elements of the array's initial state.
Constraints
Output Format
Print a single line of space-separated integers denoting the final state of the array after performing left rotations.
Sample Input
5 4
1 2 3 4 5
Sample Output
5 1 2 3 4
Explanation
When we perform left rotations, the array undergoes the following sequence of changes:
Thus, we print the array's final state as a single line of space-separated values, which is 5 1 2 3 4.
#include <iostream>
#include <vector>
using namespace std;
void leftRotate(vector<int>& arr, int d) {
int n = arr.size();
// Create a temporary array to store the rotated elements
vector<int> temp(d);
// Copy the first 'd' elements to the temporary array
for (int i = 0; i < d; i++) {
temp[i] = arr[i];
}
// Shift the remaining elements to the left
for (int i = d; i < n; i++) {
arr[i - d] = arr[i];
}
// Copy the elements from the temporary array back to the original array
for (int i = 0; i < d; i++) {
arr[n - d + i] = temp[i];
}
}
int main() {
int n, d; // Number of elements and the number of positions to rotate
cin >> n >> d;
vector<int> arr(n);
// Input the array elements
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
// Perform left rotation
leftRotate(arr, d);
// Output the rotated array
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
return 0;
}