-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRotateArrayByKElement.java
More file actions
82 lines (61 loc) · 1.4 KB
/
Copy pathRotateArrayByKElement.java
File metadata and controls
82 lines (61 loc) · 1.4 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
74
75
76
77
78
79
80
81
package tcs.practice.array;
import java.util.Scanner;
public class RotateArrayByKElement {
public static void main(String[] args) {
int arr[] = {4,2,5,8,6,2,3};
Scanner sc = new Scanner(System.in);
System.out.println("enter the k element");
int k =sc.nextInt();
int m=k;
rotatearray(arr,k,m);
}
public static void rotatearray(int arr[],int k,int m) {
for(int i=k;i<arr.length;i++) {
System.out.print(arr[i]+" ");
}
if(k==m) {
for(int i=0;i<k;i++) {
System.out.print(arr[i]+" ");
}
}
}
/*public class ArrayShift {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Array Size :");
int size=sc.nextInt();
System.out.println("Enter the value of k :");
int k=sc.nextInt();
int arr[]=new int[size];
for(int i=0;i<arr.length;i++)
arr[i]=sc.nextInt();
for(int i=0;i<arr.length;i++)
{
if((i+k)<arr.length)
{
System.out.print(arr[i+k]+",");
}
else if((i+k)>=arr.length)
{
int m=i+k;
System.out.print(arr[m-arr.length]+",");
}
}
}
}*/
/*
* public static int[] rotateArray(int[] arr, int k) {
int n = arr.length;
k = k % n;
int[] result = new int[n];
int index = 0;
for (int i = k; i < n; i++) {
result[index++] = arr[i];
}
for (int i = 0; i < k; i++) {
result[index++] = arr[i];
}
return result;
}
*/
}