java利用栈的思想判断字符串中括号是否成对，通过正则表达式获取字符串表达式中数字方法

package com.bh;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

import org.apache.commons.collections.ArrayStack;

//import com.googlecode.aviator.AviatorEvaluator;

//import java.text.SimpleDateFormat;
//import java.util.Date;

//import com.googlecode.aviator.AviatorEvaluator;

public class Test {

	/**
	 * 利用栈的思想判断字符串表达式中括号是否成对。 栈先进后出
	 * 
	 * @param expression
	 * @return
	 */
	public static boolean valid(String expression) {
		// 定义一个栈数据结构
		ArrayStack stack = new ArrayStack(expression.length());
		System.out.println(stack);
		// 将符号按对应关系放到map里面，方便后面根据开始符号取对应的结束符号
		Map<String, String> map = new HashMap<>();
//		map.put("{", "}");
//		map.put("[", "]");
		map.put("(", ")");
		char[] exp = expression.toCharArray();
		for (int i = 0; i < exp.length; i++) {
			// 如果是开始符号，则压入栈
//			if (exp[i] == '{' || exp[i] == '[' || exp[i] == '(') {
//				stack.push(exp[i]);
//			}
			if (exp[i] == '('){
				if(i>0){
					if(Pattern.matches("\\d",String.valueOf(exp[i-1]))){//(括号前面不能跟数字
						return false;
					}
					if(Pattern.matches("\\d",String.valueOf(exp[i-1]))){//(括号前面不能跟And或者or
						return false;
					}
				}
				stack.push(exp[i]);
			}
			System.out.println(exp[i]);
			// 如果是结束符号，则判断当前栈顶元素和该结束符号是否是对应关系
			if (exp[i] == ')'){
				if(i+1<exp.length){
					if(Pattern.matches("\\d",String.valueOf(exp[i+1]))){//）括号后面不能跟数字
						return false;
					}
				}
				if(i>0){
					if(String.valueOf(exp[i-1]).equals(")")){//不能出现连在一起的括号
						return false;
					}
				}
				if (stack.isEmpty()) {
					return false;
				}
				String c = String.valueOf(stack.pop());
				if (exp[i] != map.get(c).toCharArray()[0]) {
					return false;
				}
			}
		}
		if (!stack.isEmpty()) {
			return false;
		}
		return true;
	}

	/**
	 * 通过正则表达式获取字符串表达式中数字
	 * 
	 * @return
	 */
	public static List<String> getExpressionNum(String expression) {
		expression = expression.replace(" ", "");
		Pattern pattern = Pattern.compile("\\d+");
		Matcher matcher = pattern.matcher(expression);
		List<String> strList = new ArrayList<>();
		while (matcher.find()) {
			System.out.println(matcher.group());
			strList.add(matcher.group());
		}
		return strList;
	}

	public static void  jiaoyan(String expression){
		System.out.println("expression"+expression);
		expression = expression.replace(" ", "");
//		Pattern pattern = Pattern.compile("([a-z]+)");
		Pattern pattern = Pattern.compile("\\W+");
		Matcher matcher = pattern.matcher(expression);
		List<String> strList = new ArrayList<>();
		System.out.println(matcher);
		while (matcher.find()) {
			System.out.println(matcher.group());
			strList.add(matcher.group());
		}
	}
	
	public static void main(String[] args) {

	}
}