栈-单词逆序
来源:互联网 发布:star法则 程序员 编辑:程序博客网 时间:2024/06/14 04:24
package c_stack.B_wordReverse;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* 单词逆序
*
* @author Administrator
*
*/
public class ReverseApp {
public static void main(String[] args) throws IOException {
String input, output;
while (true) {
System.out.println("Enter a String");
System.out.flush();
input = getString();
if (("").equals(input)) {
break;
}
Reverser reverser = new Reverser(input);
output = reverser.doRev();
System.out.println("Reversed:" + output);
}
}
public static String getString() throws IOException {
String s = new BufferedReader(new InputStreamReader(System.in))
.readLine();
return s;
}
}package c_stack.B_wordReverse;
/**
* 反转
* @author Administrator
*
*/
public class Reverser {
private String input;
private String output;
public Reverser(String in) {
input=in;
}
public String doRev(){
int stackSize=input.length();
WordReverse wordReverse=new WordReverse(stackSize);
for(int i=0;i<stackSize;i++){
char c=input.charAt(i);
wordReverse.push(c);
}
output="";
while(!wordReverse.isEmpty()){
output+=wordReverse.pop();
}
return output;
}
}package c_stack.B_wordReverse;
public class WordReverse {
private int maxSize;
private char[] stackArray;
private int top;
public WordReverse(int max) {
maxSize = max;
stackArray = new char[max];
top = -1;
}
/*
* 锟斤拷栈
*/
public void push(char i){
stackArray[++top]=i;
}
/*
* 锟斤拷栈
*/
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;
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* 单词逆序
*
* @author Administrator
*
*/
public class ReverseApp {
public static void main(String[] args) throws IOException {
String input, output;
while (true) {
System.out.println("Enter a String");
System.out.flush();
input = getString();
if (("").equals(input)) {
break;
}
Reverser reverser = new Reverser(input);
output = reverser.doRev();
System.out.println("Reversed:" + output);
}
}
public static String getString() throws IOException {
String s = new BufferedReader(new InputStreamReader(System.in))
.readLine();
return s;
}
}package c_stack.B_wordReverse;
/**
* 反转
* @author Administrator
*
*/
public class Reverser {
private String input;
private String output;
public Reverser(String in) {
input=in;
}
public String doRev(){
int stackSize=input.length();
WordReverse wordReverse=new WordReverse(stackSize);
for(int i=0;i<stackSize;i++){
char c=input.charAt(i);
wordReverse.push(c);
}
output="";
while(!wordReverse.isEmpty()){
output+=wordReverse.pop();
}
return output;
}
}package c_stack.B_wordReverse;
public class WordReverse {
private int maxSize;
private char[] stackArray;
private int top;
public WordReverse(int max) {
maxSize = max;
stackArray = new char[max];
top = -1;
}
/*
* 锟斤拷栈
*/
public void push(char i){
stackArray[++top]=i;
}
/*
* 锟斤拷栈
*/
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;
}
}
0 0
- 栈-单词逆序
- C# 栈实现单词逆序
- 单词逆序
- Java编程-栈应用(单词逆序)
- 使用栈实现单词逆序输出
- Chapter4:栈的应用-单词逆序
- 栈应用——单词逆序
- java使用栈实现单词的逆序
- 句子逆序,单词不逆序
- 堆栈-单词逆序
- 单词逆序--堆栈方法
- 逆序输出单词
- 字符串中的单词逆序
- 逆序字符串中的单词
- 字符串中单词逆序
- 单词逆序算法
- 逆序输出单词
- 字符数组单词逆序
- poj 1276 Cash Machine (多重背包)
- 热修复学习总结-QZone
- 我的第一篇博客
- 1002. A+B for Polynomials (25)
- PCIe总线的基础知识
- 栈-单词逆序
- 游戏服务端架构发展史(中)
- 十八掌大数据视频免费领
- JAVA编程思想笔记--第一章 对象导论
- CSDN如何转载别人的文章
- JS实现点击显示与隐藏
- 栈-中缀表达式换成后缀
- notify产生死锁的场景(备忘)
- TCP与UDP区别