迭代器接口:
public intece MyIterator<T> { boolean hasNext(); //是否还有下一个元素 T next(); //得到下一个元素 T remove();}
具体的迭代器就是集合具体实现里面的迭代器内部类,下面是使用 :
public class TestUse { public static void main(String args[]){ //分别定义两种结构 MyList<String> array = new MyArrayList<String>(); MyList<String> link = new MyLinkedList<String>(); //添加数据 for(int i = 1;i < 15; i){ array.add(i""); link.add(i""); } //数组操作 System.out.println(array.remove()); System.out.println(array.get(5)); System.out.println(array.remove(5)); System.out.println(array.get(5)); System.out.println(array.remove("7")); System.out.println(array.set(0, "00")); //使用迭代器 MyIterator<String> ai = array.iterator(); while(ai.hasNext()) System.out.print(ai.next()" "); System.out.println(); System.out.println(link.remove()); System.out.println(link.get(5)); System.out.println(link.remove(5)); System.out.println(link.get(5)); System.out.println(link.remove("7")); System.out.println(link.set(0, "00")); //使用迭代器 MyIterator<String> li = link.iterator(); while(li.hasNext()) System.out.print(li.next()" "); System.out.println(); System.out.println("a size=" array.size()); System.out.println("l size=" link.size()); }}
本文来自电脑杂谈,转载请注明本文网址:
http://www.pc-fly.com/a/jisuanjixue/article-33893-18.html
他也是命好
那么二炮可以点射犯我之敌
难