LinkedList 的简单操作：插入 删除正序、逆序遍历

package test812.night;

import java.util.Iterator; import java.util.LinkedList; import java.util.List; import java.util.ListIterator;

public class Test2 {

public static void main(String[] args) { // TODO Auto-generated method stub List alist = new LinkedList(); alist.add( 111 ); alist.add( "AAA"); alist.add( "BBB" ); alist.add( 333 ); printList(alist); printReversedList(alist); alist.add(2, 222); System.out.println(); System.out.print("在索引位置2插入元素222后，"); printList(alist); ListIterator it = alist.listIterator(); while(it.hasNext()){ Object object = it.next(); if (object instanceof Integer) { it.remove(); }else if (object instanceof String) { String oString = (String)object; it.set(oString.toLowerCase()); } } System.out.println(); System.out.println("删除链表中Integer类型的元素后并把字符串改为小写："); printList(alist); } public static void printList(List list){ ListIterator it = list.listIterator(); System.out.println("正序遍历链表中的元素："); while( it.hasNext()){ Object object = it.next(); System.out.print("\t" + object ); } } public static void printReversedList(List list){ ListIterator it = list.listIterator(list.size()); System.out.println("\n逆序遍历链表中的元素："); while( it.hasPrevious()){ Object object = it.previous(); System.out.print("\t" + object ); } }

}