java迭代器原理1

**package simple;
/**
* 迭代器原理:初级
* @author Lenovo
*
*/
public class SimpleList {

public String element[]= {"a","b","c"};

public int size=element.length;
//计数器
private int course=-1;
public int size() {
    return this.size;
}
public boolean hasnext() {

    return course+1<this.size;      
}
public String next() {
    course++;
    return element[course];
}
public void remove() {
    //移动数组元素
    System.arraycopy(element, course+1, element, course, this.size-(course+1));
    //实际大小
    this.size--;
    //指针回位
    course--;
}

public static void main(String[] args) {

}

}**