Question

In C++, "remove" elements in an array that are repeated (including those that are negative and vice versa i.e. 1 = -1 and -3 = 3) while keeping the original.

ex: original array = {1,2,-3,4,5,3, -1, 3, 5, 2,6,4) final array = {1,2,-3,4,5,6)

As a hint, To "remove" the array, it's something with array[j] = array[j+1] and decrement the length but I'm having trouble

thanks! (Can't use vectors, maps, sets, can only use for loops, if statements, and stuff like that)

Answer 1

#include<iostream>

using namespace std;

int main()
{
//array declaration and initialization
   int originalArray[] = {1,2,-3,4,5, 3, -1, 3, 5, 2,6,4};
  
   //calculate the size of array
   int size = sizeof(originalArray)/sizeof(originalArray[0]);
  
   //display the original array
   cout<<"The original array is: "<<endl;
   for(int i=0;i<size;++i)
   {
       cout<<originalArray[i]<<" ";
   }
  
   //remove the duplicate elements
   for(int i=0;i<size;i++)
   {
       for(int j=i+1; j<size; j++)
       {
           if(originalArray[i]==originalArray[j] || originalArray[i]==-originalArray[j])
           {
               for(int k=j;k<size-1;++k)
               {
                   originalArray[k]=originalArray[k+1];
               }
               --size;
               j--;
           }
       }
   }
  
   //display the resultant array
   cout<<endl<<endl<<"The array after removing the duplicate element is: "<<endl;
   for(int i=0;i<size;++i)
   {
       cout<<originalArray[i]<<" ";
   }

   return 0;
}

OUTPUT: