java資料結構和演算法------棧

標籤：

 1 package iYou.neugle.list; 2  3 public class MySeqStack<T> { 4     private Stack stack = new Stack(); 5  6     class Stack { 7         public int maxSize = 10; 8         public T[] data = (T[]) new Object[maxSize]; 9         public int top = -1;// 棧頂指標10     }11 12     // 初始化棧13     public void SeqStackInit() {14         this.stack.top = -1;15         System.out.println("棧初始化成功!");16     }17 18     // 入棧19     public void SeqStackPush(T data) {20         if (this.stack.top == this.stack.maxSize - 1) {21             System.out.println("棧中內容已滿!");22             return;23         }24         this.stack.data[++this.stack.top] = data;25     }26 27     // 出棧28     public T SeqStackPop() {29         if (this.stack.top == -1) {30             System.out.println("棧中內容已空!");31         }32         T data = this.stack.data[stack.top];33         this.stack.data[this.stack.top] = null;34         this.stack.top--;35         return data;36     }37 38     // 擷取棧頂元素39     public T SeqStackPeek() {40         if (this.stack.top == -1) {41             System.out.println("棧中內容已空!");42             return null;43         }44         return this.stack.data[this.stack.top];45     }46 }

 

java資料結構和演算法------棧