How to remove all duplicates from an array

Question

I want to remove every duplicate from an array in Java and store the remaining integers in the same array.

E.g.: int[] = { 5,5,5,3,4,4,2,2,1}; ==> int[] = {3,1};

So far I have tried using:

Set<Integer> set = new HashSet<Integer>();

for (int i = 0; i < array.length; i++) {
  set.add(array[i]);
}

It appears though, that this only removes one of the duplicates and not both.

Any help would be appreciated.

Possible duplicate of Get unique values from arraylist in java — Okapist
– Okapist, Commented Apr 7, 2017 at 16:31
Please add more context. All you show for now is a loop that adds elements to a set. Then what? — user3458
– user3458, Commented Apr 7, 2017 at 17:16
One possible problem is that Java arrays are not resizeable. What do you do with array elements that used to contain the duplicates? — user3458
– user3458, Commented Apr 7, 2017 at 17:16

prasanth · Accepted Answer · 2017-04-07 16:31:24Z

0

You can use a HashMap to maintain the count of each element and remove those elements that have count greater than 1.

public int[] removeDuplicates(int[] arr) {
   Map<Integer, Integer> countMap = new LinkedHashMap<>(); // To maintain the order
   for (int n : arr) {
      Integer count = countMap.get(n);
      if (count == null) {
         count = 0;
      }
      count++;
      countMap.put(n, count);
   }

   for(Iterator<Map.Entry<String, String>> it = countMap.entrySet().iterator(); it.hasNext(); ) {
      Map.Entry<String, String> entry = it.next();
      if (entry.getValue() > 1) {
         it.remove();
      }
   }

   return new ArrayList<>(countMap.keySet()).toArray(new int[0]);
}

answered Apr 7, 2017 at 16:31

prasanth

3,6025 gold badges31 silver badges42 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Vasu · Accepted Answer · 2017-04-07 16:58:57Z

0

You don't even a set, it is very simple, convert the array to a List and then use Collections.frequency to check for duplicates as shown below:

    Integer[] array = { 5,5,5,3,4,4,2,2,1};
    List<Integer> listInputs = Arrays.asList(array);
    List<Integer> listOutputs = new ArrayList<>();
    for(int value : listInputs) {
         if(Collections.frequency(listInputs, value) ==1) {
             listOutputs.add(value);
         }
    }
    System.out.println(listOutputs);

OUTPUT: [3, 1]

edited Apr 7, 2017 at 16:58

answered Apr 7, 2017 at 16:54

Vasu

22.6k11 gold badges54 silver badges71 bronze badges

2 Comments

Marc H. Over a year ago

Thanks for your answer. Sadly I am always receiving the following warning : The type List is not generic; it cannot be parameterized with arguments <Integer>

prasanth Over a year ago

This is a nice idea. But Collections.frequency() has a runtime of O(n) which is bad. This code will have a total run time of O(n^2).

Vasu · Accepted Answer · 2017-04-07 17:00:32Z

0

This should work :

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

 Arrays.sort(array);
 Set<Integer> set = new HashSet<Integer>();

 Set<Integer> duplicateSet = new HashSet<Integer>();

 for (int i = 0; i < array.length; i++) {

     if(!set.add(array[i])){
         duplicateSet.add(array[i]);
     }
 }


 System.out.println(duplicateSet.toString());
 set.removeAll(duplicateSet);
 System.out.println(set.toString());

output :

[1,3]

edited Apr 7, 2017 at 17:00

Vasu

22.6k11 gold badges54 silver badges71 bronze badges

answered Apr 7, 2017 at 16:29

Alekhya

2821 silver badge7 bronze badges

1 Comment

prasanth Over a year ago

This will not work if there are odd number of duplicates

Collectives™ on Stack Overflow

How to remove all duplicates from an array

3 Answers 3

Comments

2 Comments

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

2 Comments

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related