zoukankan      html  css  js  c++  java
  • 遍历List集合的四种方法

    package sun.rain.amazing.traversal;
    
    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.Iterator;
    import java.util.List;
    
    public class TraversalList {
        public static void main(String args[]){
    
            List<String> list = new ArrayList<String>(
                Arrays.asList("tom","cat","Jane","jerry"));
    
    
    
            //方法1 集合类的通用遍历方式, 从很早的版本就有, 用迭代器迭代
            Iterator it1 = list.iterator();
            while(it1.hasNext()){
                System.out.println(it1.next());
            }
    
    
    
            //方法2 集合类的通用遍历方式, 从很早的版本就有, 用迭代器迭代
            for(Iterator it2 = list.iterator();it2.hasNext();){
                System.out.println(it2.next());
            }
          
         
         //  或者
         for(ListIterator its = coll.iterator();its.hasNext()){
                Object obj = its.next();
                if(obj.equals("abc")){
                    its.add("haha");
                }
            }
      
        //方法3 增强型for循环遍历 
        for(String value:list){ 
          System.out.println(value); 
        } 
    
    
        //方法4 一般型for循环遍历 
        for(int i = 0;i < list.size(); i ++){ 
          System.out.println(list.get(i)); 
        }  
  • 相关阅读:
    Largest Rectangle in Histogram
    Valid Sudoku
    Set Matrix Zeroes
    Unique Paths
    Binary Tree Level Order Traversal II
    Binary Tree Level Order Traversal
    Path Sum II
    Path Sum
    Validate Binary Search Tree
    新手程序员 e
  • 原文地址:https://www.cnblogs.com/goolu/p/9040125.html
Copyright © 2011-2022 走看看