Iterator

这里写图片描述

public interface Collection {
    void add(Object o);
    int size();
}


----------
public class ArrayList implements Collection {
    private int size=0;
    Object[] os = new Object[10];
    @Override
    public void add(Object o) {
        if(size == os.length){
            Object[] newOs = new Object[os.length*2];
            System.arraycopy(os, 0, newOs, 0, os.length);
            os = newOs;
        }
        os[size] = o;
        size++;
    }

    @Override
    public int size() {
        return size;
    }

    Iterator iterator(){
        ArrayListIterator it = new ArrayListIterator();
        return it;
    }
    class ArrayListIterator implements Iterator{
        int current = 0;
        @Override
        public boolean hasNext() {
            if(current==size)
                return false;
            else { 
                current++;///
                return true;
            }
        }

        @Override
        public Object next() {
            return os[current-1];
        }

    }

}


----------
import static org.junit.Assert.*;

import org.junit.Assert;
import org.junit.Test;
/**
 * @author Thinkpad
 *
 */
public class ArrayListTest {
    /**
     * Test method for {@link ArrayList#add(java.lang.Object)}.
     */
    @Test
    public void testAdd() {
        String str="test---";
        ArrayList al = new ArrayList();
        for(int i=0;i<3;i++){
            al.add(str+i);
        }
        Iterator it = al.iterator();
        while(it.hasNext()){
            System.out.println(it.next());
        }
    } 
}


----------
public interface Iterator {
    boolean hasNext();
    Object next();
}


----------
public class LinkedList implements Collection {
    private int size = 0;
    Node head = new Node();
    Node tail = head;

    @Override
    public void add(Object o) {
        Node n = new Node();
        tail.setData(o);
        tail.setNode(n);
        tail = n;
        size++;
    }

    @Override
    public int size() {
        return size;
    }

    Iterator iterator() {
        return new LinkedListIterator();
    }

    private class Node {
        Object data;
        Node node;

        public Object getData() {
            return data;
        }

        public void setData(Object data) {
            this.data = data;
        }

        public Node getNode() {
            return node;
        }

        public void setNode(Node node) {
            this.node = node;
        }
    }

    class LinkedListIterator implements Iterator {
        Node temp = head;
        Node data = temp;
        @Override
        public boolean hasNext() {
            if (temp.node == null)
                return false;
            else {
                data = temp;
                temp = temp.node;
                return true;
            }
        }

        @Override
        public Object next() {
            return data.data;
        }

    }
}


----------
import static org.junit.Assert.*;

import org.junit.Assert;
import org.junit.Test;
/**
 * @author Thinkpad
 *
 */
public class LinkedListTest {

    /**
     * Test method for {@link LinkedList#add(java.lang.Object)}.
     */
    @Test
    public void testAdd() {
        LinkedList ll = new LinkedList();
        ll.add(new String("ni hao a!"));
        ll.add(new String("wo ye hao a!"));
        Iterator it = ll.iterator();
        while(it.hasNext()){
            System.out.println(it.next());
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值