import java.util.ArrayList;
import java.util.Arrays;
public class CommonNumbers {
	public static void main(String[] args) {
          int[] array1A = {1, 3, 4, 6, 7, 9};
          int[] array2A = {1, 2, 4, 5, 9, 10};
          Integer[] com = common(array1A,array2A);
          for(int i : com) {
              System.out.println(i);
          }
	}
	public static Integer[] common(int array1[], int array2[]) {
		
		int p1=0,p2=0;
		ArrayList<Integer> list = new ArrayList<>();
		while(p1<array1.length && p2 < array2.length) {
			
			if(array1[p1]  == array2[p2]) {
				list.add(array1[p1]);
				p1++;
				p2++;
			}else if(array1[p1] > array2[p2]) {
				p2++;
			}else {
				p1++;
			}
		}
		Integer[] common = new Integer[list.size()];
		return list.toArray(common);
	}
}
Output:- 
1
4
9
  
Thursday, March 18, 2021
Common elements in two sorted arrays
Subscribe to:
Post Comments (Atom)
How to find middle node of LinkedList without using extra memory in java
To find the middle node of a LinkedList without using extra memory in Java, you can use the "tortoise and hare" algorithm. This al...
- 
public class ReverseArrayWithoutExtraMemory { public static void main(String[] args) { int arr[] = {1,2,3,4,5,6}; int swapArray[] =...
- 
public class SumPair { public static void main(String[] args) { int arr[] = {5,7,8,3,1,4,6,9,2}; int n = 12; findPair(arr,n); ...
- 
1) List Interface Implementation public interface List<T extends Comparable<T>> { public Node<T> getMi...
 
 
No comments:
Post a Comment