My implementation of an iterator class

Question

I implement my own iterator class, which provides a few methods for the user to get data, and once the end of the iterator is reached, I can release the memory. How does it look?
import java.util.LinkedList;
public class MyIterator {
    private Object[] list;
    private int size;
    private int cursor;
    public MyIterator(LinkedList inList) {
        size = inList.size();
        list = Object[size];
        for(int i=0;i<size;i++){
            list[i] = (Object) inList.removeFirst();
        cursor = 0;
//check how many more items are available
    public int max_left() {
        return size - cursor;
//get the next n
    public Object[] next_n(int how_many) {
        if( cursor == size ){
            return null;
        Object[] newList = Object[how_many];
        int temp = cursor;
        for(int i=0;i<how_many;i++){
            if( cursor < size ){
                newList[i] = list[cursor++];
        checkCursor();
        return newList;
//get the next one
    public boolean next_one() {
        if( cursor < size ){
            next.value = list[cursor++];
            checkCursor();
            return true;
        return false;
    //  if the cursor has already reached the end of the list, release the list memory
    public void checkCursor(){
        if( cursor == size ){
            list = null;
}

Answer 1

Hi,
It looks very strange. I didn't look at the whole code, but why do you want an iterator that removes all elements from the original list when you create the iterator?
list[i] = (Object) inList.removeFirst();/Kaj