Question

write a c++ program that merges two arrays a and b. You may use the following array contents A=5,7,8,6,3,3 and B=4,5,6,1,2,3.The merged array should exclude all repeating numbers

Answer 1

code:

#include<bits/stdc++.h>
using namespace std;

int main(){
  
// initialize both the arrays
int a[]={5,7,8,6,3,3};
int b[]={4,5,6,1,2,3};
  
// n is sizeof array a , m is sizeof array both
// c is the final merged array of size m+n
int n=6,m=6,k=0;
int i=n-1,j=m-1;
int c[m+n];
  
// use map to mark to mark element as visited
map<int,int>mp;
  
for(int i=0;i<n;i++){
mp[a[i]]=0;
  
}
  
for(int i=0;i<m;i++){
mp[b[i]]=0;
  
}
  
// merge both the arrays
while(i>0&&j>0){
if(mp[a[i]]!=1){
c[k++]=a[i];
mp[a[i]]=1;
}
i--;
  
if(mp[b[j]]!=1){
c[k++]=b[j];
mp[b[j]]=1;
}
j--;
}
  
// if some element remains in array a
  
while(i>=0){
if(mp[a[i]]!=1){
c[k++]=a[i];
mp[b[i]]=1;
}
i--;
}
  
// if some element remains in array b
while(j>=0){
if(mp[b[j]]!=1){
c[k++]=b[j];
mp[b[j]]=1;
}
j--;
}
  
// print final array
cout<<"Final array after merging with duplicates removed is : \n";
  
for(int i=0;i<k;i++){
cout<<c[i]<<" ";
}
  
}

screenshots:

Output: