Remove repeated elements in an ArrayList

[Miles Runner]

Hello,
How can we remove repeated elements in an ArrayList?. I have tried it many times but I can not find the correct code for it. here is an example

ex: (16 51 54 85 54 16 51 2 3 51) -> (16 51 54 85 2 3)

there is a special function for that? If you know what or which is the method to be used here , then please let me know about it. Thank you.

[Linux-Us]

Hello,
We must reconstruct a new ArrayList and add items in it by checking that there are not already ..

public boolean contains (Object elem)

this will returns true if this list contains the specified element.

public boolean add (Object o)

Appends the specified element to the end of this list.

[InterNetWorKed]

Hello,
The above explanation is correct or you can start with an algo that your route table and determines whether an index is identical to another and there a leash. then you implements in Java. If you need more information about it then you can visit the sun's official site for java , and there you can find the more detailed information for this.

[NetWorkInG]

Hello,

Someclass lt = new ArrayList (new HashSet (monArrayList));

This is not necessarily the most efficient but unless you have a large number of data it works very well and above all, it's easy to read and understand. Like to know what the API sometimes helps to get rid of algos , As a bonus you can even sort the result by replacing by HashSet TreeSet. Try it and if you get an error then post the error so that we can sort your problem and make the program run successfully.

[cyber-noob]

Hello,
Get rid of the algorithm is to deprive a good reflection of development. not bad in itself to use the api. But I can not help it I formatted like that. Algo code then that's all. So I always have a pen and a sheet. but for small program you can do without, but for an app. I think seeing the demand for the program that is been asked you can use the above method easily without any problem.

[NetworkeR]

Hello,
What is the interest of wasting time reinventing something that exists in the API? This is especially true for large applications or it has to do better. The most important is when using the API was not adapted. As I said in that case it must make its own algo if the list is big enough (or sufficiently often filtered) for the performance suffer. A good reflection of development is to always use the same method but to do what is best.