<七>java数据结构与算法 栈 实现单词逆序

<span style="font-size:18px;">public class Reverse {
	private String input;
	
	public Reverse(String input) {
		this.input = input;
	}
	
	public String doReverse() {
		CharStack cs = new CharStack(input.length());
		for(int i = 0; i < input.length(); i++) {
			char ch = input.charAt(i);
			cs.push(ch);
		}
		String output = "";
		while(!cs.isEmpty()) {
			char ch = cs.pop();
			output += ch;
		}
		return output;
	}
	
}

public class CharStack {
	private int maxSize;
	
	private char[] arr;
	
	private int top;
	
	// 构造方法
	public CharStack(int size) {
		maxSize = size;
		arr = new char[maxSize];
		top = -1;
	}
	
	// 压入数据
	public void push(char value){
		arr[++top]=value;
	}
	
	// 弹出数据
	public char pop() {
		return arr[top--];
	}
	
	// 访问栈顶元素
	public char peek() {
		return arr[top];
	}
	
	// 栈是否为空
	public boolean isEmpty() {
		return (top == -1);
	}
	
	// 栈是否满了
	public boolean isFull() {
		return (top == maxSize - 1);
	}
	
}
public class TestReverse {

	public static void main(String[] args) {
		Reverse re = new Reverse("我是快乐的小屌丝");
		System.out.println(re.doReverse());
	}

}</span>