Java implementation of the list to go heavy

Source: Internet
Author: User
Tags object object set set

Method One, use the For loop traversal to remove the repeating element code in the list as follows

 Public Static voidMain (string[] args) {Test07 test07=NewTest07 ();    System.out.println (Test07.getlist ()); }     PublicList getList () {list originallist=NewArrayList (); Originallist.add (1); Originallist.add (3); Originallist.add (3); Originallist.add (5); Originallist.add (7); Originallist.add (7); Originallist.add (13); List templist=NewArrayList ();  for(Object object:originallist) {if(!Templist.contains (object))            {Templist.add (object); }        }        returntemplist; }

Mode two, use set to redo the code snippet as follows

// The use of set set uniqueness to remove weight        New HashSet (originallist);         New ArrayList (set);         return templist;

Method three, using TreeSet to remove duplicate elements

New TreeSet (originallist);         New ArrayList ();        Templist.addall (TreeSet);         return templist;

Java implementation of the list to go heavy

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.