数据结构(一)栈(一)

public class MyStack<Item> implements Iterable<Item>  {
private Item a[] = (Item[])new Object[1];   
private int N=1;
public boolean isEmpty() {
    return N==0;
}
private void resize(int max) {
    Item temp[] = (Item[])new Object[max];
    for(int i= 0;i<N;i++) {
        temp[i] = a[i];
    }
    a = temp;
}
public void push(Item item) {
    if(N==a.length) {
        resize(2*a.length);
    }
    a[N++] = item;
}
public Item pop() {
    Item item = a[--N];
    a[N] = null;
    if(N>0&&N==a.length/4) {
        resize(a.length/2);
    }
    return item;
}

@Override
public Iterator<Item> iterator() {
    // TODO Auto-generated method stub
    return new MyIterator();
}
private class MyIterator implements Iterator<Item>{
private int i = N;

@Override
public boolean hasNext() {
    // TODO Auto-generated method stub
    return i>0;
}

@Override
public Item next() {
    // TODO Auto-generated method stub
    return a[--i];
}
@Override
    public void remove() {
        // TODO Auto-generated method stub
    }
}
}