How can i remove duplicate elements from an unsorted array...?

Question

I need the code to remove duplicates without sorting

Answer 1

Couple of questions on this one. Remove or print out? If remove, remove and leave index null or resize array? Finally, possible to use list instead?

Answer 2

Wachirakorn had a great hashset example in a question right below yours. You should be able to use his example and alter it to fit your needs with very little effort.

Answer 3

import java.util.LinkedHashSet;
import java.util.Set;

public class Program
{
public static void main(String[] args) {
int x[] = { 9,1,2,3,4,5,6,7,8,9,3,6,7 };
Set<Integer> set = new LinkedHashSet<Integer>();
for(int i : x){
if(!set.contains(i)){
set.add(i);
}
}

x = new int[set.size()];
int index = 0;
for(int i : set){
x[index++]=i;
}

for(int i : x){
System.out.print(i+" ");
}
}
}

Answer 4

We cannot remove an element from java basic array []. We need Set to remove duplicate elements. Then create a new array from the Set.

Answer 5

I want to remove.. resized.. list can be used.. but finally it should return an array

Answer 6

I just used it... but I don't know how to re size the array