Java基础-集合：LinkedList 已知数组存放一批QQ号码，QQ号码最长为11位，最短为5位String[] strs = {"12345","67891","12347809933"...

Java基础-集合：LinkedList

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

将该数组里面的所有qq号都存放在LinkedList中，将list中重复元素删除，将list中所有元素分别用迭代器和增强for循环打印出来。

package com.dzqc.Day0104;

import java.util.Iterator;
import java.util.LinkedList;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: zhangxiaokun
 * @Date: 2022/01/04/10:14
 * @Description:Java基础-集合：LinkedList

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

将该数组里面的所有qq号都存放在LinkedList中，将list中重复元素删除，将list中所有元素分别用迭代器和增强for循环打印出来。
 */
public class Zuoye0104 {

    public static void main(String[] args) {

        String[] strs = {"12345","67891","12347809933","98765432102","67891","12347809933"};
        LinkedList<String> linkedList = new LinkedList<>();
        for (int i = 0; i < strs.length; i++) {
            linkedList.add(strs[i]);
        }

        for (int i = 0; i < linkedList.size(); i++){
            for (int j = i+1; j < linkedList.size(); j++){
                if (linkedList.get(i).equals(linkedList.get(j))){
                    linkedList.remove(j);
                }
            }
        }


        for (Iterator<String> it = linkedList.listIterator(); it.hasNext(); ) {
            System.out.print(it.next() + "\t");
        }

        System.out.println();


        for (String s : linkedList) {
            System.out.print(s + "\t");
        }
        System.out.println();

    }

}