为包含节点的java哈希表编写我们自己的迭代器

import java.util.Iterator;

public class HashTableIterator implements Iterator<Node> {
    private Node[] table;
    private int position;

    public HashTableIterator(Node[] table) {
        this.table = table;
        this.position = 0;
    }

    @Override
    public boolean hasNext() {
        return position < table.length;
    }

    @Override
    public Node next() {
        Node node = table[position];
        position++;
        return node;
    }

    @Override
    public void remove() {
        // 在哈希表中删除当前位置对应的节点
        // 实现删除操作的代码
    }
}