如何实现栈(以链表的形式)

package list;

import java.util.Arrays;

public class MyStack {
	private Object[] stack;
	private int size;  //栈大小
	public MyStack(){
		stack = new Object[10];
	}
	//判断栈是否为空
public boolean isEmpty(){
	return size==0;
}
//取栈顶元素
public int peek(){
	if(isEmpty()){
		return (Integer) null;
	}
	return  (int) stack[size-1];
}
//栈顶元素出栈
public int  pop(){
	int e=peek();
	stack[size-1]=null;
	size--;
	return e;
}
public int push(int item){
	ensureCapacity(size+1);
	stack[size++]=item;
	return item;
	
}
public void ensureCapacity(int size){
	int len= stack.length;
	if(size>len){
		int newlen=10;
		stack = Arrays.copyOf(stack, newlen);
	}
}
	public static void main(String[] args) {
	MyStack s= new MyStack();

	System.out.println(s.size);
	System.out.println(s.pop());
	System.out.println(s.size);

	}

}

猜你喜欢

转载自blog.csdn.net/qq_33098049/article/details/81202675
今日推荐