已知数组存放一批QQ号码，QQ号码最长为11位，最短为5位String[] strs = {“12345“,“67891“,“12347809933“,“98765432102“,“67891“,“1

代码

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);

        //foreach
        for (String s : linkedList){
            System.out.println(s);
        }

        //iterator
        Iterator<String> it = linkedList.iterator();
        while (it.hasNext()){
            System.out.println(it.next());
        }
    }
}