Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Union of Arrays
//'main' method must be in a class 'Rextester'. //openjdk version '11.0.5' import java.io.*; import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n1 = Integer.parseInt(br.readLine()); int arr1[] = new int[n1]; StringTokenizer st1 = new StringTokenizer(br.readLine()); for(int i=0;i<arr1.length;i++) arr1[i] = Integer.parseInt(st1.nextToken()); int n2 = Integer.parseInt(br.readLine()); int arr2[] = new int[n2]; StringTokenizer st2 = new StringTokenizer(br.readLine()); for(int i=0;i<arr2.length;i++) arr2[i] = Integer.parseInt(st2.nextToken()); int i=0,j=0; while(i<arr1.length && j<arr2.length){ if(arr1[i]<arr2[j]){ System.out.print(arr1[i++]+" "); } else if(arr1[i]>arr2[j]){ System.out.print(arr2[j++]+" "); } else{ System.out.print(arr1[i]+" "); i++;j++; } } while(i<arr1.length) System.out.print(arr1[i++]+" "); while(j<arr2.length) System.out.print(arr2[j++]+" "); } }
run
|
edit
|
history
|
help
0
Print Longest String
Sort
// Java Coding Challenge - 09: Find out duplicate numbers using HashSet
exp 4
AVL-GO-FLAT
Fmt test
overloading
Odd Numbers
Tree ZigZag Traversal
MAP List Iterator