java實現棧,java實現棧的類

本文目錄一覽：

• 1、java如何自定義棧？
• 2、用java編寫出來：用數組實現一個棧
• 3、java用鏈表實現棧

java如何自定義棧？

public class Stack{

int[] data;

int maxSize;

int top;

public Stack(int maxSize) {

this.maxSize=maxSize;

data=new int[maxSize];

top=-1;

}

//入棧

public boolean push(int data) {

//入棧先判斷棧中是否已滿

if(top+1==maxSize) {

System.out.println(“棧已滿”);

return false;

}

this.data[++top]=data;

return true;

}

//出棧

public int pop() throws Exception{

//出棧先判斷棧是否已空

if(top==-1) {

throw new Exception(“棧已空”);

}

return this.data[top–];

}

public static void main(String[] args) throws Exception {

Stack stack=new Stack(1000);

stack.push(1);

stack.push(2);

stack.push(3);

stack.push(4);

stack.push(5);

while(stack.top=0) {

System.out.println(stack.pop());

}

}

}

用java編寫出來：用數組實現一個棧

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()){

Object[] newStack = new Object[size() * 3 / 2 + 1];

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) {

Stack stack = new Stack(3);

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用鏈表實現棧

public Object setEle(Object element)

{

Object oldElement = this.element;

this.element = element;

return oldElement;

}

是啥意思，給值還return？？把這函數刪了

public Linked()

{

nextNode = null;

element = null;

}

改成

public Linked(Object element)

{

this.element = element;

nextNode = null;

}