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<T> /單鏈表結(jié)點(diǎn)類，T指定結(jié)點(diǎn)的元素類型 public T data; /數(shù)據(jù)域，保存數(shù)據(jù)元素 public Node<T> next; /地址域，引用后繼結(jié)點(diǎn) public Node(T data, Node<T>

2、next) /構(gòu)造結(jié)點(diǎn)，data指定數(shù)據(jù)元素，next指定后繼結(jié)點(diǎn) this.data = data;this.next = next; public Node() this(null, null); 程序2：import java.util.ArrayList;public class SinglyList<T> public Node<T> head; public int length; /以上為默認(rèn)構(gòu)造方法，構(gòu)造空單鏈表public static ArrayList<String> union=new ArrayList<String>(

3、); public SinglyList() this.head = new Node<T>(); /以上為構(gòu)造單鏈表 public SinglyList(T element) this(); /創(chuàng)建空單鏈表，只有頭結(jié)點(diǎn)this.length = element.length; Node<T> 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 N

4、ode<T>(elementi, null); /創(chuàng)建結(jié)點(diǎn)鏈入rear結(jié)點(diǎn)之后 rear = rear.next; /rear指向性的鏈尾結(jié)點(diǎn) public String toString() String str = "("Node<T> p = this.head.next;while (p != null) str += p.data.toString(); if (p.next != null) str += "," /不是最后一個(gè)結(jié)點(diǎn)時(shí)，后加分隔符 p = p.next;return str + ")"

5、; /空表返回() public String addAll(SinglyList list) Node<T> p = this.head.next;String str = "("while (p != null) Node<T> q = list.head.next; while (q != null) if ( p.data.toString().equals(q.data.toString() /集合的元素值相等 if (!str.equals("(") str += "," /用逗號(hào)間隔 str +=

6、 p.data.toString(); this.union.add(p.data.toString() ;q = q.next; p = p.next; return str + ")" /以上為求交集過程。 public String union(SinglyList list) Node<T> p = this.head.next;String str = "("while (p != null) Node<T> q = list.head.next; int i = 0; while (q != null) if (!p.

7、data.toString().equals(q.data.toString() i+; if (i = list.length) for(int a=0;a<union.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<T> w = list.hea

8、d.next;while (w != null) str += "," str += w.data.toString(); w = w.next;return str + ")" /以上為求并集過程。 public String difference(SinglyList list) Node<T> p = this.head.next;String str = "("while (p != null) Node<T> q = list.head.next; int i = 0; while (q != nul

9、l) if ( !p.data.toString().equals(q.data.toString() i+; if (i = list.length) if (!str.equals("(") str += "," str += p.data.toString(); q = q.next; p = p.next; i = 0; return str + ")" /以上為求差集過程。程序3：import java.util.Scanner;public class MainClass public static void main(S

10、tring args) int a, b;Scanner cin = new Scanner(System.in);System.out.print("請輸入集合A的元素（用英文逗號(hào)間隔）：");String a_string=cin.nextLine();String suma=a_string.split(",");System.out.print("請輸入集合B的元素（用英文逗號(hào)間隔）：");String b_string=cin.nextLine();String sumb=b_string.split(",");SinglyList<String> list1 = new SinglyList<String>(suma);SinglyList<String> list2 = new SinglyList<String>(sumb);System.out.println("集合A和集合B的交集為："+list1.addAll(list2);System.out.println("集合A和集合B