public class ArrayToStackAndQueue {
//用数组表示栈
public static class ArrayStack {
private Integer[] arr;
private Integer size;
public ArrayStack(int initSize) {
if (initSize < 0) {
throw new IllegalArgumentException("The init size is less than 0");
}
arr = new Integer[initSize];
size = 0;
}
//得到栈顶元素
public Integer peek() {
if (size == 0) {
return null;
}
return arr[size - 1];
}
//进栈
public void push(int obj) {
if (size == arr.length) {
throw new ArrayIndexOutOfBoundsException("The stack is full");
}
arr[size++] = obj;
}
//出栈
public Integer pop() {
if (size == 0) {
throw new ArrayIndexOutOfBoundsException("The stack is empty");
}
return arr[--size];
}
}
//用数组表示队列
public static class ArrayQueue {
private Integer[] arr;
private Integer size;
private Integer first;
private Integer last;
public ArrayQueue(int initSize) {
if (initSize < 0) {
throw new IllegalArgumentException("The init size is less than 0");
}
arr = new Integer[initSize];
size = 0;
first = 0;
last = 0;
}
//得到队列头的元素
public Integer peek() {
if (size == 0) {
return null;
}
return arr[first];
}
//入队列
public void push(int obj) {
if (size == arr.length) {
throw new ArrayIndexOutOfBoundsException("The queue is full");
}
size++;
arr[last] = obj;
last = last == arr.length - 1 ? 0 : last + 1;
}
//出队列
public Integer poll() {
if (size == 0) {
throw new ArrayIndexOutOfBoundsException("The queue is empty");
}
size--;
int tmp = first;
first = first == arr.length - 1 ? 0 : first + 1;
return arr[tmp];
}
}
}