java算法之下压栈来动态调整数组大小

最新推荐文章于 2023-11-20 22:58:29 发布

Intelige

最新推荐文章于 2023-11-20 22:58:29 发布

阅读量700

点赞数

文章标签： java算法

本文链接：https://blog.csdn.net/u013422712/article/details/26012991

版权

import java.util.Iterator;
import java.util.Spliterator;
import java.util.function.Consumer;
public class ResizingArraysStack<Item>implements Iterable<Item> {
private Item[] a=(Item[])new Object[1];
private int N=0;
public boolean isEmpty(){return N==0;};
public int size(){return N;};
public 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;

   }
   public Iterator<Item> iterator()
   {
       return new ReverseArrayIterator();

   }
   private class ReverseArrayIterator implements Iterator<Item>{
       private int i=N;
       public boolean hasNext(){return i>0;}
       public Item next(){return a[--i];}
       public void remove(){}
   }
}
public Iterator<Item> iterator() {
   // TODO Auto-generated method stub
   return null;
}
public void forEach(Consumer<? super Item> action) {
   // TODO Auto-generated method stub

}
public Spliterator<Item> spliterator() {
   // TODO Auto-generated method stub
   return null;
}
}