Java练习题day04
1.已知数组存放一批QQ号码,QQ号码最长为11位,
最短为5位String[] strs = {“12345”,“67891”,“12347809933”
,“98765432102”,“67891”,“12347809933”}。
将该数组里面的所有qq号都存放在LinkedList中,
将list中重复元素删除,将list中所有元素分别用迭代器和
增强for循环打印出来
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;
import javax.swing.text.StyledEditorKit.ForegroundAction;
public class Question01 {
public static void main(String[] args) {
String[] strs = {
"12345","67891",
"12347809933","98765432102","67891","12347809933"};
List<String> list = new LinkedList<String>();
for (String string : strs) {
list.add(string);
}
//将List中重复元素删除
//List<String>rList = removeElementsByCount(list);
//System.out.println(rList);
//计算数组中每个单词出现的次数
//返回值 Map<String,Integer>
/**
* 12345:2
* 67891:3
*/
Map<String,Integer> map = strCount(list