日撸Java三百行 day14(栈)

1. 栈及基本操作

1.1 栈

栈是一种操作受限的顺序表，其插入删除只能在固定的一端进行，称为入栈和出栈。

1.2 入栈

入栈首先检查首付是否栈满，若栈不满再存入新元素在最后一个位置(栈顶)，并把深度加一，否则提示栈满并返回false。

public boolean push(char paraChar) {
	if (depth == MAX_DEPTH) {
		System.out.println("Stack full.");
		return false;
	} // Of if
		
	data[depth] = paraChar;
	depth++;
		
	return true;
}// Of push

1.3出栈 

出栈时要先检查栈中是否还有元素可以出栈，若有元素在栈中，则出栈最后一个位置(栈顶)的元素，并使深度减一返回出栈元素，否则提示栈空返回'\0'。

public char pop() {
	if (depth == 0) {
		System.out.println("Nothing to pop.");
		return '\0';
	} // Of if
		
	char resultChar = data[depth - 1];
	depth--;
		
	return resultChar;
}// Of pop

2.栈的简单测试

package datastructure.stack;

/**
 * Char stack. I do use Stack because it is already defined in java.
 * 
 * @author Yunhua Hu yunhuahu0528@163.com.
 */
public class CharStack {
	/**
	 * The depth.
	 */
	public static final int MAX_DEPTH = 10;
	
	/**
	 * The actual depth.
	 */
	int depth;
	
	/**
	 * The data.
	 */
	char[] data;
	
	/**
	 *********************
	 * Construct an empty char stack.
	 *********************
	 */
	public CharStack() {
		depth = 0;
		data = new char[MAX_DEPTH];
	}// Of the first constructor
	
	/**
	 *********************
	 * Overrides the method claimed in Object, the superclass of any class.
	 ********************* 
	 */
	public String toString() {
		String resultString = "";
		for (int i = 0;i < depth ;i++) {
			resultString += data[i];
		} // Of for i;
		
		return resultString;
	}// Of toString
	
	/**
	 *********************
	 * Push an element.
	 *
	 * @param paraChar The given char.
	 * @return Success or not.
	 *********************
	 */
	public boolean push(char paraChar) {
		if (depth == MAX_DEPTH) {
			System.out.println("Stack full.");
			return false;
		} // Of if
		
		data[depth] = paraChar;
		depth++;
		
		return true;
	}// Of push
	
	/**
	 *********************
	 * Pop an element.
	 *
	 * @return The popped char.
	 *********************
	 */
	public char pop() {
		if (depth == 0) {
			System.out.println("Nothing to pop.");
			return '\0';
		} // Of if
		
		char resultChar = data[depth - 1];
		depth--;
		
		return resultChar;
	}// Of pop
	
	/**
	 *********************
	 * The entrance of the program.
	 *
	 * @param args Not used now.
	 *********************
	 */
	public static void main(String args[]) {
		CharStack tempStack = new CharStack();
		
		for (char ch = 'a'; ch < 'm'; ch++) {
			tempStack.push(ch);
			System.out.println("The current stack is: " + tempStack);	
		} // Of for ch
		
		char tempChar;
		for (char i = 0; i < 12; i++) {
			tempChar = tempStack.pop();
			System.out.println("Poped: " + tempChar);
			System.out.println("The current stack is: " + tempStack);
		} // Of for i
	}// Of main
}// Of CharStack

输出: