Stack判断括号婚配

Stack判断括号匹配

public class MatchReg {private static Stack<Character> stack = new Stack<Character>();/** * 简介：判断"{}"是否匹配 * 思路：遇"{"入栈, 遇"}"出栈 * @param reg * @return */private static  boolean isMatch(String reg){char cAarry[] = reg.toCharArray();for(char c: cAarry){if(c == '{'){stack.push(c);}else if(c == '}'){stack.pop();}if(stack.isEmpty()){return true;}}return false;}