Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.HashSet;
- import java.util.Iterator;
- import java.util.LinkedList;
- import java.util.Set;
- import java.util.TreeSet;
- public class deneme3 {
- public static void main(String[] args) {
- Set<Integer> s1 = new HashSet<Integer>();
- s1.add(1);
- s1.add(4);
- s1.add(7);
- s1.add(9);
- printSet(s1);
- System.out.println();
- Set<Integer> s2 = new HashSet<Integer>();
- s2.add(2);
- s2.add(4);
- s2.add(5);
- s2.add(6);
- s2.add(7);
- printSet(s2);
- System.out.println();
- printSet(simetricSetDifference(s1, s2));
- }
- public static Set<Integer> simetricSetDifference(Set<Integer> s1, Set<Integer> s2) {
- Set<Integer> toReturn = new TreeSet<Integer>();
- Iterator<Integer> itr = s1.iterator();
- while( itr.hasNext() ) {
- int val = itr.next();
- if( !s2.contains(val) ) {
- toReturn.add(val);
- }
- }
- itr = s2.iterator();
- while( itr.hasNext() ) {
- int val = itr.next();
- if( !s1.contains(val) ) {
- toReturn.add(val);
- }
- }
- return toReturn;
- }
- public static void printSet(Set<Integer> l) {
- Iterator<Integer> itr = l.iterator();
- for(int i=0; itr.hasNext(); i++) {
- System.out.print(itr.next());
- if(itr.hasNext()) {
- System.out.print(", ");
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement