【第4节】Java代码实现栈--小例子--单词逆序

package com.java.chapterFour;

import java.util.Scanner;

public class LetterStackApp {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        PushAndPop();
    }
    public static void PushAndPop(){
        Scanner sc=new Scanner(System.in);
        String input=sc.nextLine();
        StackLetter stack=new StackLetter(input.length());
        for(int i=0;i<input.length();i++){
            stack.push(input.charAt(i));
        }
        String  out = "";
        while(!stack.isEmpty()){
            char ch=stack.pop();
            out=out+ch;
        }
        System.out.println(out);
    }
}
class StackLetter{
    private int maxSize;
    private char[] stackArray;
    private int top;

    StackLetter(int n){
        stackArray=new char[n]; 
        maxSize=n;
        top=-1;
    }
    public void push(char j){
        stackArray[++top]=j;
    }
    public char pop(){
        return stackArray[top--];
    }
    public char peek(){
        return stackArray[top];
    }
    public boolean isEmpty(){
        return (top==-1);
    }
    public boolean isFull(){
        return (top==maxSize-1);
    }
}