Java数据结构与算法笔记——栈

栈

class ArrayStack {
	private int maxSize;
	private int[] stack;
	private int top = -1;

	public void setMaxSize(int maxSize) {
		this.maxSize = maxSize;
		stack = new int[this.maxSize];
	}

	public boolean isFull() {
		return top == maxSize - 1;
	}

	public boolean isEmpty() {
		return top == -1;
	}

	public void push(int value) {
		if (isFull()) {
			System.out.println("栈满");
			return;
		}
		top++;
		stack[top] = value;
	}
	
	public int pop() {
		if(isEmpty()) {
			throw new RuntimeException("栈空");
		}
		int value = stack[top];
		top--;
		return value;
	}
	
	public void list() {
		if(isEmpty()) {
			System.out.println("栈空");
			return;
		}
		for(int i=top;i>=0;i--) {
			System.out.println("stack[%d]=%d\n,i,stack[i]");
		}
	}
}

栈实现综合计算器

public static void main(String[] args) {
		String expression = "3+2*6-2";
		ArrayStack2 numStack = new ArrayStack2(10);
		ArrayStack2 operStack = new ArrayStack2(10);

		int index = 0;
		int num1 = 0;
		int num2 = 0;
		int oper = 0;
		int res = 0;
		char ch = ' ';
		String keepNum = "";
		while (true) {
			ch = expression.substring(index, index + 1).charAt(0);
			if (operStack.isOper(ch)) {
				if (!operStack.isEmpty()) {
					if (operStack.priority(ch) <= operStack.priority(operStack.peek())) {
						num1 = numStack.pop();
						num2 = numStack.pop();
						oper = operStack.pop();
						res = numStack.cal(num1, num2, oper);
						numStack.push(res);
						operStack.push(ch);
					} else {
						operStack.push(ch);
					}
				} else {
					operStack.push(ch);
				}
			} else {
				keepNum += ch;
				if (index == expression.length() - 1) {
					numStack.push(Integer.parseInt(keepNum));
				} else {
					if (operStack.isOper(expression.substring(index + 1, index + 2).charAt(0))) {
						numStack.push(ch);
						keepNum = "";
					}
				}
			}
			index++;
			if (index >= expression.length()) {
				break;
			}
		}

		while (true) {
			if (operStack.isEmpty()) {
				break;
			}
			num1 = numStack.pop();
			num2 = numStack.pop();
			oper = operStack.pop();
			res = numStack.cal(num1, num2, oper);
			numStack.push(res);
		}
		int res2 = numStack.pop();
		System.out.printf("表达式%s=%d", expression, res2);
	}
}

class ArrayStack2{
	private int maxSize;
	private int[] stack;
	private int top = -1;

	public ArrayStack2(int maxSize) {
		this.maxSize = maxSize;
		stack = new int[this.maxSize];
	}

	public boolean isFull() {
		return top == maxSize - 1;
	}

	public boolean isEmpty() {
		return top == -1;
	}

	public int peek() {
		return stack[top];
	}

	public void push(int value) {
		if (isFull()) {
			System.out.println("栈满");
			return;
		}
		top++;
		stack[top] = value;
	}

	public int pop() {
		if (isEmpty()) {
			throw new RuntimeException("栈空");
		}
		int value = stack[top];
		top--;
		return value;
	}

	public void list() {
		if (isEmpty()) {
			System.out.println("栈空");
			return;
		}
		for (int i = top; i >= 0; i--) {
			System.out.println("stack[%d]=%d\n,i,stack[i]");
		}
	}

	public int priority(int oper) {
		if (oper == '*' || oper == '/')
			return 1;
		else if (oper == '+' || oper == '-')
			return 0;
		else
			return -1;
	}

	public boolean isOper(char val) {
		return val == '+' || val == '-' || val == '*' || val == '/';
	}

	public int cal(int num1, int num2, int oper) {
		int res = 0;
		switch (oper) {
		case '+':
			res = num1 + num2;
		case '-':
			res = num2 - num1;
		case '*':
				res = num1 * num2;
		case '/':
			try{
				res = num2 / num1;
				}
				catch(ArithmeticException e) {
				System.out.println("除数不能为0");
				}
		default:
			break;
		}
		return res;
	}
}