Implements the set set that is used primarily, and the set set is characterized by the non-repetition of elements within the collection.
Specific code:
Import Java.util.hashset;import Java.util.set;public class Test {public static void main (string[] args) {set<integer& Gt result = new hashset<integer> (); set<integer> Set1 = new hashset<integer> (); set<integer> Set2 = new hashset<integer> (); Set1.add (one); Set1.add (Set1.add); 333 (4); Set2.add, Set2.add (333); Set2.add (1); System.out.println ("Set1 =" +set1.tostring ()); System.out.println ("Set2 =" +set2.tostring ()); Result.clear (); Result.addall (Set1); Result.retainall (Set2); System.out.println ("intersection =" + result); Result.clear (); Result.addall (Set1); Result.removeall (Set2); SYSTEM.OUT.PRINTLN ("Difference set =" +result); Result.clear (); Result.addall (Set1); Result.addall (Set2); System.out.println ("set =" + result);}}
The results of the operation are as follows:
Java set operations: Finding intersection, set, and set difference