Java LinkList遍历方式

1.LinkedList的遍历方式

a.一般的for循环(随机访问)

[java] view plain copy 
 
1.int size = list.size();  
2.for (int i=0; i<size; i++) {  
3.    list.get(i);          
4.}  

 

b.for–each循环

[java] view plain copy 
 
1.for (Integer integ:list)   
2.    ;  

c.迭代器iterator

[java] view plain copy 
 
1.for(Iterator iter = list.iterator(); iter.hasNext();)  
2.    iter.next();  

d.用pollFirst()来遍历LinkedList

[java] view plain copy 
 
1.while(list.pollFirst() != null)  
2.    ;  

e.用pollLast()来遍历LinkedList

[java] view plain copy 

1.while(list.pollLast() != null)  
2.    ;  

f.用removeFirst()来遍历LinkedList

[java] view plain copy 
 
1.try {  
2.    while(list.removeFirst() != null)  
3.        ;  
4.} catch (NoSuchElementException e) {  
5.}  

g.用removeLast()来遍历LinkedList

[java] view plain copy 
 
1.try {  
2.    while(list.removeLast() != null)  
3.        ;  
4.} catch (NoSuchElementException e) {  
5.} 

LinkedList遍历效率分析：

[java] view plain copy 
 
1.package com.sheepmu;  
2.import java.util.Iterator;  
3.import java.util.LinkedList;  
4.import java.util.NoSuchElementException;  
5.  
6./* 
7. * @author SheepMu 
8. */  
9.public class LinkedListTest {  
10.    public static void main(String[] args) {  
11.        LinkedList<Integer> llist = new LinkedList<Integer>();  
12.        for (int i=0; i<100000; i++)  
13.            llist.addLast(i);  
14.          
15.        byCommonFor(llist) ;// 通过一般for循环来遍历LinkedList  
16.        byForEach(llist) ;  // 通过for-each来遍历LinkedList  
17.        byIterator(llist) ; // 通过Iterator来遍历LinkedList  
18.        byPollFirst(llist) ;    // 通过PollFirst()遍历LinkedList     
19.        byPollLast(llist) ; // 通过PollLast()遍历LinkedList   
20.        byRemoveFirst(llist) ;   // 通过removeFirst()遍历LinkedList     
21.        byRemoveLast(llist) ; // 通过removeLast()遍历LinkedList  
22.    }  //需要获取资料的朋友请加Q君样：290194256*

23.      
24.   
25.    private static void byCommonFor(LinkedList<Integer&g