public class Stack {
private Object[] stack;
//这个不需要;
//private int top = 0; //初始化栈顶
//这个也不需要;
//写一个栈出来,最好是可以动态的,可以自己改变大小的,即数组的长度;
//private int size = 0; // 初始化大小
//元素个数;
private int size;
//默认长度为10;
public Stack(){
this(10);
}
//也可以自己设置长度,即容量;
public Stack(int len){
stack = new Object[len];
//返回元素个数;
public int size(){
return size;
//返回数组长度,即容量;
public int capacity(){
return stack.length;
//实现动态的数组;
public void ensureCapacity(){
if(size() == capacity()){
System.arraycopy(stack, 0, newStack, 0, size());
stack = newStack;
//入栈;
public void push(Object o){
size++;
ensureCapacity();
stack[size - 1] = o;
/*
public void push(Object object) {
if (isFull()) {
System.out.println("栈满! 入栈失败");
stack[top++] = object;
*/
//判空;
public boolean isEmpty(){
return size == 0;
//出栈;
public Object pop(){
//首先要判空;
if(isEmpty()){
throw new ArrayIndexOutOfBoundsException("不能为空");
Object o = stack[--size];
stack[size] = null;
return o;
// 出栈
public Object pop() {
Object object = stack[--top];
stack[top] = null;
return object;
// 计算栈当前大小
public int size() {
return top;
// 判断是否是空栈
public boolean isEmpey() {
return top == 0;
// 判断是否栈满
public boolean isFull() {
return top = size;
public Stack(int size) {
this.size = size;
public static void main(String[] args) {
String[] data = new String[] { "a", "b", "c" };
for (int i = 0; i data.length; i++) {
stack.push(data[i]);
System.out.println(data[i] + "");
System.out.println("***********");
while (!stack.isEmpty()) {
System.out.println(stack.pop() + "");
//}
你自己对比一下,我是在你的里面修改的
Java堆栈类Junit测试源代码
import java.util.LinkedList;
import java.io.*;
import java.util.NoSuchElementException;
/**
*
public class MStack
{
LinkedList list;
public MStack()
list=new LinkedList();
public static void main(String[] args)
MStack MStack=new MStack();
MStack.push("ok");
MStack.push("i am ok");
System.out.println(MStack.pop());
//弹出元素
public Object pop()
try
Object o=list.getFirst();
list.removeFirst();
catch(NoSuchElementException e)
//System.out.println(e);
return null;
//压入元素
public void push(Object o)
list.addFirst(o);
//得到栈顶元素
public Object getTop()
if(list.size()!=0)
return list.getFirst();
else
以上就是土嘎嘎小编为大家整理的java栈例子代码相关主题介绍,如果您觉得小编更新的文章只要能对粉丝们有用,就是我们最大的鼓励和动力,不要忘记讲本站分享给您身边的朋友哦！！