Question

Question11)
Create two arrays STP [ ] and STQ [ ] , both of type int create another array STUN [ ] that contains all elements from both the arrays without any repetition For Example:
Input STP [ ]: 7 54 36 87 44 92 28 77
STQ[ ]: 72 94 44 33 77 87 17 37

please help me fast I need to submit this by today​

Answer 1

Answer:

// Simple C++ program to remove duplicates

#include<iostream>

using namespace std;

// Function to remove duplicate elements

// This function returns new size of modified

// array.

int removeDuplicates(int arr[], int n)

{

// Return, if array is empty

// or contains a single element

if (n==0 || n==1)

return n;

int temp[n];

// Start traversing elements

int j = 0;

for (int i=0; i<n-1; i++)

// If current element is not equal

// to next element then store that

// current element

if (arr[i] != arr[i+1])

temp[j++] = arr[i];

// Store the last element as whether

// it is unique or repeated, it hasn't

// stored previously

temp[j++] = arr[n-1];

// Modify original array

for (int i=0; i<j; i++)

arr[i] = temp[i];

return j;

}

// Driver code

int main()

{

int arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5};

int n = sizeof(arr) / sizeof(arr[0]);

// removeDuplicates() returns new size of

// array.

n = removeDuplicates(arr, n);

// Print updated array

for (int i=0; i<n; i++)

cout << arr[i] << " ";

return 0;