Java数据结构之栈的基本定义与实现方法示例

package com.java.stack;public class CharStack { private int maxSize;// 站的大小 private char[] arr; private int top;// 指向栈顶元素 public CharStack(int size) {  this.maxSize = size;  this.arr = new char[maxSize];  this.top = -1; }  public void push(char value) {   arr[++top] = value; }  public char pop() {  return arr[top--]; }  public long peek() {  return arr[top]; }  public boolean isEmpty() {  return (top == -1); }  public boolean isFull() {  return (top == maxSize - 1); }  public String reverse(String text) {  for (int i = 0; i < text.length(); i++) {   push(text.charAt(i));  }  String result = "";  while (!isEmpty()) {   result += (char)pop();  }  return result; } public static void main(String[] args) {  CharStack stack = new CharStack(30);  while (!stack.isFull()) {   stack.push('l');   stack.push('a');   stack.push('k');   stack.push('m');   stack.push('n');   stack.push('e');   stack.push('b');   stack.push('f');   stack.push('d');   stack.push('e');  }  System.out.println("编程网测试结果:");  System.out.println("----------------------------弹出----------------------------");  while (!stack.isEmpty()) {   System.out.println(stack.pop());  }  System.out.println("----------------------------反序----------------------------");  System.out.println(stack.reverse("abcdefg")); }}