TITLE:-
Rotate array
PROBLEM:-
Change in the input array/list itself. You don't need to return or print the elements.
The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
First line of each test case or query contains an integer 'N' representing the size of the array/list.
Second line contains 'N' single space separated integers representing the elements in the array/list.
Third line contains the value of 'D' by which the array/list needs to be rotated.
For each test case, print the rotated array/list in a row separated by a single space.
Output for every test case will be printed in a separate line.
1 <= t <= 10^4
0 <= N <= 10^6
0 <= D <= N
Time Limit: 1 sec
1
7
1 2 3 4 5 6 7
2
3 4 5 6 7 1 2
2
7
1 2 3 4 5 6 7
0
4
1 2 3 4
2
1 2 3 4 5 6 7
3 4 1 2
SOLUTION:-
#include <iostream>
using namespace std;
void rotate(int *input, int d, int n)
{
int arr[d];
for(int p=0;p<d;p++)
{
arr[p]=input[p];
}
int i;
for(i=0;i<n-d;i++)
{
input[i]=input[i+d];
}
for(int k=0;k<d;k++)
{
input[i]=arr[k];
i++;
}
}
int main()
{
int t;
cin >> t;
while (t--)
{
int size;
cin >> size;
int *input = new int[size];
for (int i = 0; i < size; ++i)
{
cin >> input[i];
}
int d;
cin >> d;
rotate(input, d, size);
for (int i = 0; i < size; ++i)
{
cout << input[i] << " ";
}
delete[] input;
cout << endl;
}
return 0;
}
This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.
If you have any doubts then please let me know... ConversionConversion EmoticonEmoticon