代碼

import java.util.HashSet; import java.util.Iterator; import java.util.LinkedList; import java.util.Set;/*2.已知數組存放一批QQ號碼，QQ號碼最長為11位，最短為5位String[] strs = {"12345","67891","12347809933","98765432102","67891","12347809933"}。將該數組里面的所有qq號都存放在LinkedList中，將list中重復元素刪除，將list中所有元素分別用迭代器和增強for循環打印出來。*/ public class Homework2 {public static void main(String[] args) {String[] strs = {"12345","67891","12347809933","98765432102","67891","12347809933"};Set<String> set = new HashSet<>();for (int i = 0; i < strs.length; i++) {set.add(strs[i]);}LinkedList<String> linkedList = new LinkedList<>(set);//foreachfor (String s : linkedList){System.out.println(s);}//iteratorIterator<String> it = linkedList.iterator();while (it.hasNext()){System.out.println(it.next());}} }

總結

以上是生活随笔為你收集整理的已知数组存放一批QQ号码，QQ号码最长为11位，最短为5位String[] strs = {“12345“,“67891“,“12347809933“,“98765432102“,“67891“,“1的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。