Java集合并交差運(yùn)算

1、、題目要求：用Java語言實(shí)現(xiàn)單鏈表的基本操作，并實(shí)現(xiàn)集合的交、并和差運(yùn)算。1、輸出兩個(gè)集合的交集，即找出兩個(gè)集合的相同元素。2、輸出兩個(gè)集合的并集，即把兩個(gè)集合的全部元素不重復(fù)的加起來。3、輸出兩個(gè)集合的差集，即從一個(gè)集合中找出另一個(gè)集合里沒有的元素。三、設(shè)計(jì)思路：程序1： 單鏈表結(jié)點(diǎn)public class Node/單鏈表結(jié)點(diǎn)類，T指定結(jié)點(diǎn)的元素類型public T data;/數(shù)據(jù)域，保存數(shù)據(jù)元素public Node next; /地址域，引用后繼結(jié)點(diǎn)public Node(T data, Node next) /構(gòu)造結(jié)點(diǎn)，data指定數(shù)據(jù)元素，this.data = data;th

2、is.next = next;public Node()this(null, null);程序2：import java.util.ArrayList;public class SinglyListpublic Node head;程序功能定義：next指定后繼結(jié)點(diǎn)public int length;/以上為默認(rèn)構(gòu)造方法，構(gòu)造空單鏈表public static ArrayList union=new ArrayList();public SinglyList()this.head = new Node();/以上為構(gòu)造單鏈表public SinglyList(T element)this();

3、/創(chuàng)建空單鏈表，只有頭結(jié)點(diǎn)this.length = element.length;Node rear = this.head; /rear指向單鏈表最后一個(gè)結(jié)點(diǎn)for (int i = 0; i element.length; i+)/若element=null，跑出空對象異常；element.length=0時(shí)，構(gòu)造空鏈表rear.next = new Node(elementi, null);/創(chuàng)建結(jié)點(diǎn)鏈入rear結(jié)點(diǎn)之后rear = rear.next;/rear指向性的鏈尾結(jié)點(diǎn)public String toString()String str = (;Node p = this.h

4、ead.next;while (p != null)str += p.data.toString();if (p.next != null)str += ,; /不是最后一個(gè)結(jié)點(diǎn)時(shí)，后加分隔符p = p.next;return str + );/空表返回()public String addAll(SinglyList list)Node p = this.head.next;String str = (;while (p != null)Node q = list.head.next;while (q != null)if ( p.data.toString().equals(q.data.

5、toString()/集合的元素值相等if (!str.equals()str += ,;/用逗號間隔str += p.data.toString(); this.union.add(p.data.toString() ;q = q.next;p = p.next;return str + );/以上為求交集過程。public String union(SinglyList list)Node p = this.head.next;String str = (;while (p != null)Node q = list.head.next;int i = 0;while (q != null

6、)if (!p.data.toString().equals(q.data.toString()i+;if (i = list.length)for(int a=0;aunion.size();a+)if( !p.data.toString().equals(union.get(a)&a=union.size()-1)if (!str.equals() str += ,;str += p.data.toString();q = q.next;p = p.next;i = 0;Node w = list.head.next;while (w != null)str += ,;str +=

7、 w.data.toString();w = w.next;return str + );/以上為求并集過程。public String difference(SinglyList list)Node p = this.head.next;String str = (;while (p != null)Node q = list.head.next;int i = 0;while (q != null)if ( !p.data.toString().equals(q.data.toString()i+;if (i = list.length)if (!str.equals() str += ,

8、;str += p.data.toString();q = q.next;p = p.next;i = 0;return str + );/以上為求差集過程。程序3：import java.util.Scanner;public class MainClasspublic static void main(String args)int a, b;Scanner cin = new Scanner(System.in);System.out.print(請輸入集合A的元素(用英文逗號間隔) ：);String a_string=cin.nextLine();String suma=a_stri

9、ng.split(,);System.out.print(請輸入集合B的元素(用英文逗號間隔) ：);String b_string=cin.nextLine();String sumb=b_string.split(,);SinglyList list1 = new SinglyList(suma);SinglyList list2 = new SinglyList(sumb);System.out.println(集合A和集合B的交集為：+list1.addAll(list2);System.out.println(集合A和集合B的并集為：+list1.union(list2);System.out.println(A與B的差集為：+Iist1.difference(list2);System.out.println(B與A的差集為：+Iist2.difference(listl);四、程