How to Remove Duplicates from a List While Preserving Order?

How to Efficiently Remove Duplicates from a List

You encounter a scenario where you need to remove duplicate elements from a list. However, your current approach, as you describe in the code snippet, is not yielding the desired results.

One effective method to remove duplicates while maintaining the original order is to utilize a LinkedHashSet. This set-based data structure automatically discards duplicate elements while preserving the insertion order.

To achieve this, you can convert the existing list to a LinkedHashSet using the following code:

<code class="java">List<Customer> dedupeCustomers = new ArrayList<>(new LinkedHashSet<>(customers));</code>

Alternatively, if you prefer to modify the original list, you can opt for this approach:

<code class="java">Set<Customer> dedupeCustomers = new LinkedHashSet<>(customers);
customers.clear();
customers.addAll(dedupeCustomers);</code>

This method first creates a new LinkedHashSet containing the unique elements from the original list. The original list is then cleared and replaced with the deduped set's elements, effectively removing any duplicates.

By implementing either of these solutions, you can efficiently remove duplicates from your list, ensuring that each element appears only once while preserving the original order if desired.

The above is the detailed content of How to Remove Duplicates from a List While Preserving Order?. For more information, please follow other related articles on the PHP Chinese website!