-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathMergeTwoSortedArrayInZigzagManner.java
57 lines (57 loc) · 1.16 KB
/
MergeTwoSortedArrayInZigzagManner.java
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
// WAP to merge two array element in zigzag manner.
import java.util.Scanner;
public class MergeTwoSortedArrayInZigzagManner{
public static int[] zigZagArray(int a[], int b[])
{
int c[] = new int[a.length+b.length];
int i=0,j=0,k=0;
for(i=0;i<c.length;)
{
if(j<a.length && k<b.length)
{
c[i]=a[j];
j++;
i++;
c[i]=b[k];
k++;
i++;
}
if(j<a.length)
{
c[i]=a[j];
j++;
i++;
}
if(k<b.length)
{
c[i]=b[k];
k++;
i++;
}
}
return c;
}
public static int[] readArr()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the size of Array : ");
int n = sc.nextInt();
int arr[] = new int[n];
System.out.println("Enter the "+n+" elements of Array : ");
for(int i=0;i<n;i++)
{
arr[i] = sc.nextInt();
}
return arr;
}
public static void main(String[] args) {
int a[] = readArr();
int b[] = readArr();
int c[] = zigZagArray(a,b);
System.out.print("The zigzag array is : ");
for(int i=0;i<c.length;i++)
{
System.out.print(c[i]+" ");
}
}
}