代碼如下：

import java.util.AbstractList;

import java.util.Arrays;

import java.util.Iterator;

import java.util.List;

import java.util.RandomAccess;

public class Stack extends AbstractList

implements List, RandomAccess, Cloneable, java.io.Serializable{

private static final long serialVersionUID = 1L;

private Object[] elementData;

private int size;

private int length;

public Stack(int length) {

this.length = length;

elementData = new Object[this.length];

}

public Stack() {

this(10);

}

private void rangeCheck(int index) {

if (index < 0 || index >= size) {

throw new IndexOutOfBoundsException(

"Index: "+index+", Size: "+size);

}

}

public void ensureCapacity(int minCapacity) {

int oldCapacity = elementData.length;

if (minCapacity > oldCapacity) {

int newCapacity = (oldCapacity * 3)/2 +1;

if (newCapacity < minCapacity) {

newCapacity = minCapacity;

elementData = Arrays.copyOf(elementData, newCapacity);

}

}

}

public boolean push(E e) {

ensureCapacity(size + 1);

elementData[size++] = e;

return true;

}

public E pop() {

rangeCheck(size - 1);

E result = (E)elementData[--size];

elementData[size] = null;

return result;

}

public boolean isEmpty() {

return elementData == null || size == 0;

}

public E top() {

rangeCheck(size - 1);

return (E)elementData[size - 1];

}

@Override

public E get(int index) {

throw new UnsupportedOperationException("can not get");

}

@Override

public int size() {

return size;

}

@Override

protected Object clone() throws CloneNotSupportedException {

return super.clone();

}

@Override

public Iterator iterator() {

return new stackIterator();

}

private class stackIterator implements Iterator {

@Override

public boolean hasNext() {

return size > 0;

}

@Override

public E next() {

return (E)elementData[--size];

}

@Override

public void remove() {

throw new UnsupportedOperationException("can not get");

}

}

}

邏輯不復(fù)雜，小技巧是：重寫 public Iterator iterator() 方法。

測(cè)試類如下：

public class StackTest {

public static void main(String[] args) {

Stack st = new Stack();

for (int i = 0; i < 10; i++) {

st.push(i);

}

for (int i = 0; i < 10; i++) {

Integer val = st.pop();

//Integer val = st.top();

System.out.print(val);

System.out.print('\t');

}

for (Integer val : st) {

System.out.print(val);

System.out.print('\t');

}

}

}

總結(jié)

以上是生活随笔為你收集整理的stack java实现_Stack （堆栈）使用JAVA实现的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。