Stack的创建实例以及字符串倒叙的java实现

public class Stack {
    
    public static void main(String args[])
    {
        ArrayTest1 arr = new ArrayTest1(10);
        
        
        arr.push(8);
        arr.push(7);
        arr.push(6);
        arr.push(5);
        
        while(!arr.isEmpty())
        {
            System.out.print(arr.pop()+" ");
        }
    }
}
class ArrayTest1
{
    private int maxsize;
    private long[] a;
    private int top;
    
    public ArrayTest1(int maxsize)
    {
        this.maxsize = maxsize;
        a = new long[this.maxsize];
        top = -1;
    }
    
    public void push(long value)
    {
        a[++top] = value;
    }
    
    public long pop()
    {
        return a[top--];
    }
    
    public boolean isEmpty()
    {
        return (top==-1);
    }
    
    public boolean isFull()
    {
        return (top==maxsize-1);
    }
    
    public long peek()
    {
        return a[top];
    }
}

 

 

 

 

下面的这段代码是字符串倒叙的java实现，采用了栈的数据结构，不输入字符串则自动退出。用JUnit测试完成，按照提示自动导入JUnit包就可以运行。

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import org.junit.Test;

public class Reverse {
    private String input;
    private String output;
    public Reverse(String in)
    {
        input = in;
    }
    
    public String doRev()
    {
        int stackSize = input.length();
        StackX theStack = new StackX(stackSize);
        
        for(int j=0;j<input.length();j++)
        {
            char ch = input.charAt(j);
            theStack.push(ch);
        }
        output="";
        while(!theStack.isEmpty())
        {
            char ch = (char) theStack.pop();
            output = output+ch;
        }
        return output;
    }
}


class ReverseApp
{
    @Test
    public static void main(String args[]) throws IOException
    {
        String input,output;
        while(true)
        {
            System.out.print("enter a string:");
            //flush();是流式输入输出常用的一个方法，表示强制请求清空缓冲区，
            //让i/o系统立马完成它应该完成的输入、输出动作。
            System.out.flush();
            input = getString();
            if(input.equals(""))
                break;
            Reverse theReverser = new Reverse(input);
            output = theReverser.doRev();
            System.out.println("Reversed:"+output);
        }
    }
    
    public static String getString() throws IOException
    {
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(isr);
        String s = br.readLine();
        return s;
    }
    
}

class StackX1
{
    private int maxsize;
    private char[] stackArray;
    private int top;
    
    public StackX1(int maxsize)
    {
        this.maxsize = maxsize;
        stackArray = new char[this.maxsize];
        top = -1;
    }
    
    public void push(char a)
    {
        stackArray[++top] = a;
    }
    
    public char pop()
    {
        return stackArray[top--];
    }
    
    public boolean isEmpty()
    {
        return (top==-1);
    }
    
    public char peek()
    {
        return stackArray[top];
    }
    
    public boolean isFull()
    {
        return (top==maxsize);
    }
}