zoukankan      html  css  js  c++  java
  • 栈应用实例单词逆序

    package com.study.dataStructure.linearList;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    
    //栈类
    public class StackX {
        private int maxSize;
        private char[] stackArray;
        private int top;
        
        public StackX(int max){
            stackArray = new char[max];
            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);
        }
        
    }
    
    //倒转字符串类
    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 i=0; i< stackSize; i++){
                theStack.push(input.charAt(i));
            }
            
            output = "";
            while(!theStack.isEmpty()){
                output += theStack.pop();
            }
            return output;
        }
    }
    package com.study.dataStructure.linearList;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    
    //字符串反转应用
    class ReverseApp{
        public static void main(String[] args) throws IOException{
            String input,output;
            
            while(true){
                System.out.println("请输入字符串");
                input = getString();
                if(input.equals("\r")) 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 str = br.readLine();
            return str;
        }
    }
  • 相关阅读:
    1.14验证码 彩票
    String代码示例
    1.13作业
    控制台输入人数和分数 自动判断最高分最低分
    对矩阵进行转置运算
    16、输入三角形的三个边,求其面积
    02、
    15、判断字符串是否回文——字符串
    14、求出最大元素的下标及地址值——数组
    13、字符串在指定的地方以及元素个数实行逆置——字符串
  • 原文地址:https://www.cnblogs.com/yony/p/2875062.html
Copyright © 2011-2022 走看看