public static void main(String[] args) {
List list = new ArrayList();
list.add("dsfdsfsd");
list.add("dsf");
list.add("dsfdd");
list.add("dsfdsfffdsfdsfsd");
list.add("dd");
list.sort((o1,o2)->(((String)o1).length()-((String)o2).length()));//长度从小到大排列
System.out.println(list);
//将集合元素替换成数字
list.replaceAll(ele->((String)ele).length());
System.out.println(list);
ListIterator lit = list.listIterator();
while(lit.hasNext()) {
System.out.println(lit.next());
}
//反向迭代
while(lit.hasPrevious()) {
System.out.println(lit.previous());
}
}
迭代与反向迭代
最新推荐文章于 2023-02-06 17:59:31 发布