java, how to remove dupliates only once from a sorted array?

import java.io.*;
   import java.util.*;
   import java.lang.*;
   import java.util.HashSet;
   import java.util.Set;
 
 
 
 
 
    class ArrayIns
   {
      private double[] a;  // array of values
      private int nIns;
 
 
       public ArrayIns(int size)
      {
         a = new double[size]; // create a space for the array
 
         nIns++;
 
      }
 
 
 
       public void insert(double value)
      {
         a[nIns] = value;
         nIns++;
      }
 
 
 
 
       public void insertionSort()
      {
         int in, out;
         for(out=1; out<nIns; out++) // out is dividing line
         {
            double temp = a[out]; // remove marked item
            in = out; // start shifts at out
            while(in>0 && a[in-1] >= temp) // until one is smaller,
            {
               a[in] = a[in-1]; // shift item right,
               --in;
            // go left one position
            }
            a[in] = temp; // insert marked item
         }
      } // end for
 
 
       public String toString()
      {
         StringBuffer temp = new StringBuffer();
 
 
         for(double e : a)
            temp.append(e + "");
 
         temp.append("\n");
         return temp.toString();
 
      }
 
 
 
   }
   ////////////------------------main calss --------------//////////////
 
 
 class a3
   {
       public static void main(String[] args)
 
      {
         Set uniques = new HashSet();
         Set dups = new HashSet();
 
 
         ArrayIns a[] = new ArrayIns[3];
         //int[] arr = new int[a];
 
 
         for(int i = 0;  i< 5; i++ )
         {
            Scanner s = new Scanner(System.in);
 
            System.out.println(" Enter the Integers:  ");
 
            a[i] = s.nextInt();
         }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
      }
 
 
   }

Select allOpen in new window